./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:58:34,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:58:34,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:58:34,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:58:34,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:58:34,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:58:34,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:58:34,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:58:34,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:58:34,105 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:58:34,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:58:34,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:58:34,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:58:34,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:58:34,106 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:58:34,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:58:34,106 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:58:34,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:58:34,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:58:34,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:58:34,106 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:58:34,106 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:58:34,106 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:58:34,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:58:34,106 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:58:34,107 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:58:34,107 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:58:34,107 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:58:34,107 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:58:34,107 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:58:34,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:58:34,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:58:34,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:58:34,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:58:34,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:58:34,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:58:34,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:58:34,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:58:34,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:58:34,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:58:34,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:58:34,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:58:34,107 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/UAutomizer-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 -> Automizer 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 -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2025-03-17 11:58:34,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:58:34,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:58:34,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:58:34,375 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:58:34,375 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:58:34,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2025-03-17 11:58:35,564 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9ca44e5/679a8f22d16b477badc7a97a517947f3/FLAG06c2edc73 [2025-03-17 11:58:35,887 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:58:35,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2025-03-17 11:58:35,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9ca44e5/679a8f22d16b477badc7a97a517947f3/FLAG06c2edc73 [2025-03-17 11:58:35,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9ca44e5/679a8f22d16b477badc7a97a517947f3 [2025-03-17 11:58:35,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:58:35,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:58:35,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:58:35,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:58:35,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:58:35,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:58:35" (1/1) ... [2025-03-17 11:58:35,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58710a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:35, skipping insertion in model container [2025-03-17 11:58:35,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:58:35" (1/1) ... [2025-03-17 11:58:35,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:58:36,090 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:58:36,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:58:36,112 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:58:36,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:58:36,203 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:58:36,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36 WrapperNode [2025-03-17 11:58:36,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:58:36,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:58:36,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:58:36,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:58:36,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,235 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2025-03-17 11:58:36,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:58:36,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:58:36,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:58:36,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:58:36,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,278 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 11, 31]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 2, 16]. [2025-03-17 11:58:36,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,301 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:58:36,309 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:58:36,309 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:58:36,309 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:58:36,309 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:58:36,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:36,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:58:36,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:58:36,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:58:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:58:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 11:58:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:58:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:58:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 11:58:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:58:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2025-03-17 11:58:36,349 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2025-03-17 11:58:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:58:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:58:36,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:58:36,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:58:36,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 11:58:36,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:58:36,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:58:36,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 11:58:36,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:58:36,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 11:58:36,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 11:58:36,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 11:58:36,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:58:36,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:58:36,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 11:58:36,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:58:36,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:58:36,433 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:58:36,435 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:58:36,726 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc #t~mem5.base, #t~mem5.offset; [2025-03-17 11:58:36,875 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2025-03-17 11:58:36,900 INFO L? ?]: Removed 202 outVars from TransFormulas that were not future-live. [2025-03-17 11:58:36,900 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:58:36,911 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:58:36,911 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:58:36,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:58:36 BoogieIcfgContainer [2025-03-17 11:58:36,911 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:58:36,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:58:36,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:58:36,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:58:36,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:58:35" (1/3) ... [2025-03-17 11:58:36,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de76982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:58:36, skipping insertion in model container [2025-03-17 11:58:36,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (2/3) ... [2025-03-17 11:58:36,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de76982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:58:36, skipping insertion in model container [2025-03-17 11:58:36,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:58:36" (3/3) ... [2025-03-17 11:58:36,921 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2025-03-17 11:58:36,932 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:58:36,935 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test01-1.i that has 2 procedures, 192 locations, 1 initial locations, 4 loop locations, and 92 error locations. [2025-03-17 11:58:36,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:58:36,969 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=PETRI_NET, 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;@3bd77fe8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:58:36,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-03-17 11:58:36,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 96 states have (on average 2.1145833333333335) internal successors, (203), 188 states have internal predecessors, (203), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:36,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:58:36,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:36,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:58:36,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:36,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:36,981 INFO L85 PathProgramCache]: Analyzing trace with hash 234283, now seen corresponding path program 1 times [2025-03-17 11:58:36,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:36,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133228821] [2025-03-17 11:58:36,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:37,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:58:37,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:58:37,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:37,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:37,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:37,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133228821] [2025-03-17 11:58:37,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133228821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:37,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:37,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:37,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702997448] [2025-03-17 11:58:37,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:37,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:58:37,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:37,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:58:37,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:58:37,252 INFO L87 Difference]: Start difference. First operand has 192 states, 96 states have (on average 2.1145833333333335) internal successors, (203), 188 states have internal predecessors, (203), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2025-03-17 11:58:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:37,514 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2025-03-17 11:58:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:58:37,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2025-03-17 11:58:37,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:37,522 INFO L225 Difference]: With dead ends: 186 [2025-03-17 11:58:37,522 INFO L226 Difference]: Without dead ends: 184 [2025-03-17 11:58:37,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:58:37,527 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 76 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:37,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 315 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:58:37,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-17 11:58:37,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-03-17 11:58:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 95 states have (on average 2.0210526315789474) internal successors, (192), 180 states have internal predecessors, (192), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2025-03-17 11:58:37,561 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 3 [2025-03-17 11:58:37,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:37,561 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2025-03-17 11:58:37,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2025-03-17 11:58:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2025-03-17 11:58:37,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:58:37,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:37,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:58:37,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:58:37,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:37,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:37,562 INFO L85 PathProgramCache]: Analyzing trace with hash 234284, now seen corresponding path program 1 times [2025-03-17 11:58:37,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:37,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987582530] [2025-03-17 11:58:37,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:37,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:37,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:58:37,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:58:37,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:37,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:37,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:37,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987582530] [2025-03-17 11:58:37,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987582530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:37,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:37,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:37,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80552005] [2025-03-17 11:58:37,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:37,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:58:37,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:37,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:58:37,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:58:37,719 INFO L87 Difference]: Start difference. First operand 184 states and 196 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2025-03-17 11:58:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:37,937 INFO L93 Difference]: Finished difference Result 200 states and 215 transitions. [2025-03-17 11:58:37,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:58:37,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2025-03-17 11:58:37,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:37,940 INFO L225 Difference]: With dead ends: 200 [2025-03-17 11:58:37,940 INFO L226 Difference]: Without dead ends: 200 [2025-03-17 11:58:37,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:58:37,941 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 28 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:37,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 387 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:58:37,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-17 11:58:37,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 189. [2025-03-17 11:58:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 100 states have (on average 1.99) internal successors, (199), 185 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 203 transitions. [2025-03-17 11:58:37,954 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 203 transitions. Word has length 3 [2025-03-17 11:58:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:37,954 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 203 transitions. [2025-03-17 11:58:37,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2025-03-17 11:58:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 203 transitions. [2025-03-17 11:58:37,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 11:58:37,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:37,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 11:58:37,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:58:37,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:37,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash 7262941, now seen corresponding path program 1 times [2025-03-17 11:58:37,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:37,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066987673] [2025-03-17 11:58:37,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:37,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:37,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 11:58:37,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 11:58:37,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:37,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:37,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:37,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066987673] [2025-03-17 11:58:37,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066987673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:37,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:37,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:37,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893753914] [2025-03-17 11:58:37,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:37,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:37,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:37,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:37,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:37,982 INFO L87 Difference]: Start difference. First operand 189 states and 203 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2025-03-17 11:58:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:38,085 INFO L93 Difference]: Finished difference Result 187 states and 200 transitions. [2025-03-17 11:58:38,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:38,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2025-03-17 11:58:38,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:38,086 INFO L225 Difference]: With dead ends: 187 [2025-03-17 11:58:38,087 INFO L226 Difference]: Without dead ends: 187 [2025-03-17 11:58:38,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:38,087 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 15 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:38,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 274 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:38,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-17 11:58:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-03-17 11:58:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 100 states have (on average 1.96) internal successors, (196), 183 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions. [2025-03-17 11:58:38,118 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 4 [2025-03-17 11:58:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:38,118 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions. [2025-03-17 11:58:38,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2025-03-17 11:58:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions. [2025-03-17 11:58:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 11:58:38,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:38,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 11:58:38,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:58:38,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:38,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash 7262942, now seen corresponding path program 1 times [2025-03-17 11:58:38,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:38,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565737012] [2025-03-17 11:58:38,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:38,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:38,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 11:58:38,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 11:58:38,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:38,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:38,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:38,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565737012] [2025-03-17 11:58:38,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565737012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:38,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:38,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831834239] [2025-03-17 11:58:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:38,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:38,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:38,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:38,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:38,175 INFO L87 Difference]: Start difference. First operand 187 states and 200 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2025-03-17 11:58:38,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:38,275 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2025-03-17 11:58:38,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:38,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2025-03-17 11:58:38,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:38,276 INFO L225 Difference]: With dead ends: 185 [2025-03-17 11:58:38,276 INFO L226 Difference]: Without dead ends: 185 [2025-03-17 11:58:38,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:38,277 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:38,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 281 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-17 11:58:38,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-17 11:58:38,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 100 states have (on average 1.93) internal successors, (193), 181 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2025-03-17 11:58:38,288 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 4 [2025-03-17 11:58:38,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:38,288 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2025-03-17 11:58:38,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2025-03-17 11:58:38,288 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2025-03-17 11:58:38,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:58:38,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:38,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:38,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:58:38,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:38,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:38,290 INFO L85 PathProgramCache]: Analyzing trace with hash -257832666, now seen corresponding path program 1 times [2025-03-17 11:58:38,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:38,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362616214] [2025-03-17 11:58:38,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:38,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:38,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:58:38,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:58:38,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:38,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:38,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:38,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362616214] [2025-03-17 11:58:38,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362616214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:38,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:38,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:58:38,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327100965] [2025-03-17 11:58:38,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:38,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:58:38,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:38,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:58:38,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:58:38,407 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) [2025-03-17 11:58:38,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:38,491 INFO L93 Difference]: Finished difference Result 194 states and 207 transitions. [2025-03-17 11:58:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:58:38,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2025-03-17 11:58:38,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:38,492 INFO L225 Difference]: With dead ends: 194 [2025-03-17 11:58:38,492 INFO L226 Difference]: Without dead ends: 194 [2025-03-17 11:58:38,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:58:38,493 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 18 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:38,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 710 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:58:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-17 11:58:38,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 186. [2025-03-17 11:58:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 101 states have (on average 1.9207920792079207) internal successors, (194), 182 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2025-03-17 11:58:38,506 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 9 [2025-03-17 11:58:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:38,506 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2025-03-17 11:58:38,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) [2025-03-17 11:58:38,506 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2025-03-17 11:58:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 11:58:38,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:38,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:38,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:58:38,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:38,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:38,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1320276743, now seen corresponding path program 1 times [2025-03-17 11:58:38,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:38,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057611210] [2025-03-17 11:58:38,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:38,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:38,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:58:38,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:58:38,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:38,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:38,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:38,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057611210] [2025-03-17 11:58:38,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057611210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:38,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:38,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:58:38,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92186239] [2025-03-17 11:58:38,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:38,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:58:38,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:38,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:58:38,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:58:38,577 INFO L87 Difference]: Start difference. First operand 186 states and 198 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:38,606 INFO L93 Difference]: Finished difference Result 266 states and 282 transitions. [2025-03-17 11:58:38,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:58:38,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 11:58:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:38,608 INFO L225 Difference]: With dead ends: 266 [2025-03-17 11:58:38,608 INFO L226 Difference]: Without dead ends: 266 [2025-03-17 11:58:38,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:58:38,608 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 84 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:38,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 560 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:58:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-17 11:58:38,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 230. [2025-03-17 11:58:38,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 144 states have (on average 1.9305555555555556) internal successors, (278), 225 states have internal predecessors, (278), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 282 transitions. [2025-03-17 11:58:38,615 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 282 transitions. Word has length 11 [2025-03-17 11:58:38,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:38,616 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 282 transitions. [2025-03-17 11:58:38,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:38,616 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 282 transitions. [2025-03-17 11:58:38,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:58:38,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:38,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:38,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:58:38,616 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:38,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1770627137, now seen corresponding path program 1 times [2025-03-17 11:58:38,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:38,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375720889] [2025-03-17 11:58:38,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:38,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:38,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:58:38,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:58:38,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:38,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:38,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:38,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375720889] [2025-03-17 11:58:38,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375720889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:38,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:38,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:38,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059874580] [2025-03-17 11:58:38,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:38,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:38,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:38,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:38,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:38,678 INFO L87 Difference]: Start difference. First operand 230 states and 282 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:38,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:38,798 INFO L93 Difference]: Finished difference Result 215 states and 252 transitions. [2025-03-17 11:58:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:38,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 11:58:38,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:38,800 INFO L225 Difference]: With dead ends: 215 [2025-03-17 11:58:38,800 INFO L226 Difference]: Without dead ends: 215 [2025-03-17 11:58:38,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:38,800 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 46 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:38,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 204 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:38,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-17 11:58:38,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-03-17 11:58:38,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 144 states have (on average 1.7222222222222223) internal successors, (248), 210 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 252 transitions. [2025-03-17 11:58:38,805 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 252 transitions. Word has length 13 [2025-03-17 11:58:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:38,805 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 252 transitions. [2025-03-17 11:58:38,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 252 transitions. [2025-03-17 11:58:38,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:58:38,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:38,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:38,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:58:38,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:38,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:38,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1770627138, now seen corresponding path program 1 times [2025-03-17 11:58:38,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:38,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449970043] [2025-03-17 11:58:38,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:38,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:38,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:58:38,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:58:38,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:38,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:38,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:38,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449970043] [2025-03-17 11:58:38,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449970043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:38,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:38,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:38,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104801615] [2025-03-17 11:58:38,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:38,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:38,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:38,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:38,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:38,864 INFO L87 Difference]: Start difference. First operand 215 states and 252 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:38,952 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2025-03-17 11:58:38,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:38,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 11:58:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:38,953 INFO L225 Difference]: With dead ends: 200 [2025-03-17 11:58:38,953 INFO L226 Difference]: Without dead ends: 200 [2025-03-17 11:58:38,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:38,954 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 46 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:38,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 206 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:38,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-17 11:58:38,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-17 11:58:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 144 states have (on average 1.5138888888888888) internal successors, (218), 195 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2025-03-17 11:58:38,958 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 13 [2025-03-17 11:58:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:38,958 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2025-03-17 11:58:38,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2025-03-17 11:58:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:58:38,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:38,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:38,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:58:38,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:38,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:38,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1661753082, now seen corresponding path program 1 times [2025-03-17 11:58:38,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:38,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605116398] [2025-03-17 11:58:38,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:38,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:38,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 11:58:38,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:58:38,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:38,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:39,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:39,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605116398] [2025-03-17 11:58:39,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605116398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:39,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:39,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:58:39,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53349036] [2025-03-17 11:58:39,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:39,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:58:39,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:39,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:58:39,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:58:39,059 INFO L87 Difference]: Start difference. First operand 200 states and 222 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:39,228 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2025-03-17 11:58:39,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:58:39,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 11:58:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:39,230 INFO L225 Difference]: With dead ends: 253 [2025-03-17 11:58:39,230 INFO L226 Difference]: Without dead ends: 253 [2025-03-17 11:58:39,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:58:39,231 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 24 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:39,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 412 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:58:39,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-17 11:58:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 208. [2025-03-17 11:58:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 152 states have (on average 1.513157894736842) internal successors, (230), 203 states have internal predecessors, (230), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 234 transitions. [2025-03-17 11:58:39,237 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 234 transitions. Word has length 18 [2025-03-17 11:58:39,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:39,237 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 234 transitions. [2025-03-17 11:58:39,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:39,238 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 234 transitions. [2025-03-17 11:58:39,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:58:39,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:39,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:39,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:58:39,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:39,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:39,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1661753081, now seen corresponding path program 1 times [2025-03-17 11:58:39,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:39,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561605967] [2025-03-17 11:58:39,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:39,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:39,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 11:58:39,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:58:39,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:39,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:39,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:39,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:39,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561605967] [2025-03-17 11:58:39,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561605967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:39,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:39,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:58:39,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650682525] [2025-03-17 11:58:39,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:39,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:58:39,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:39,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:58:39,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:58:39,420 INFO L87 Difference]: Start difference. First operand 208 states and 234 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:39,587 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2025-03-17 11:58:39,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:58:39,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 11:58:39,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:39,588 INFO L225 Difference]: With dead ends: 208 [2025-03-17 11:58:39,588 INFO L226 Difference]: Without dead ends: 208 [2025-03-17 11:58:39,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:58:39,589 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 4 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:39,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 428 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-17 11:58:39,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-03-17 11:58:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 152 states have (on average 1.486842105263158) internal successors, (226), 203 states have internal predecessors, (226), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 230 transitions. [2025-03-17 11:58:39,593 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 230 transitions. Word has length 18 [2025-03-17 11:58:39,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:39,593 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 230 transitions. [2025-03-17 11:58:39,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:39,593 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 230 transitions. [2025-03-17 11:58:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:58:39,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:39,594 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:39,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:58:39,594 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:39,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:39,595 INFO L85 PathProgramCache]: Analyzing trace with hash -231970729, now seen corresponding path program 1 times [2025-03-17 11:58:39,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:39,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638718572] [2025-03-17 11:58:39,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:39,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:39,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:58:39,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:58:39,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:39,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:39,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:39,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638718572] [2025-03-17 11:58:39,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638718572] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:39,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656118158] [2025-03-17 11:58:39,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:39,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:39,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:39,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:39,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:58:39,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:58:39,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:58:39,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:39,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:39,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 11:58:39,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:39,922 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 11:58:39,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-17 11:58:39,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 11:58:40,040 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:58:40,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 11:58:40,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 11:58:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:58:40,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:40,117 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_160 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_160) c_create_data_~data~0.base) (+ c_create_data_~data~0.offset 4))) 1)) is different from false [2025-03-17 11:58:40,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:40,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-17 11:58:40,162 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 40 treesize of output 28 [2025-03-17 11:58:40,170 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 9 treesize of output 5 [2025-03-17 11:58:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-17 11:58:40,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656118158] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:58:40,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:58:40,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2025-03-17 11:58:40,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9054205] [2025-03-17 11:58:40,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:40,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:58:40,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:40,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:58:40,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=112, Unknown=6, NotChecked=22, Total=182 [2025-03-17 11:58:40,198 INFO L87 Difference]: Start difference. First operand 208 states and 230 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:40,485 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2025-03-17 11:58:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:58:40,486 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 11:58:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:40,486 INFO L225 Difference]: With dead ends: 209 [2025-03-17 11:58:40,486 INFO L226 Difference]: Without dead ends: 209 [2025-03-17 11:58:40,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=112, Unknown=6, NotChecked=22, Total=182 [2025-03-17 11:58:40,487 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 44 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:40,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 719 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 434 Invalid, 0 Unknown, 92 Unchecked, 0.3s Time] [2025-03-17 11:58:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-17 11:58:40,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2025-03-17 11:58:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.4736842105263157) internal successors, (224), 202 states have internal predecessors, (224), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 228 transitions. [2025-03-17 11:58:40,511 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 228 transitions. Word has length 23 [2025-03-17 11:58:40,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:40,511 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 228 transitions. [2025-03-17 11:58:40,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 228 transitions. [2025-03-17 11:58:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:58:40,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:40,511 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:40,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:58:40,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 11:58:40,716 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:40,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:40,717 INFO L85 PathProgramCache]: Analyzing trace with hash -231970728, now seen corresponding path program 1 times [2025-03-17 11:58:40,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:40,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957885990] [2025-03-17 11:58:40,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:40,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:40,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:58:40,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:58:40,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:40,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:41,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:41,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957885990] [2025-03-17 11:58:41,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957885990] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:41,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961561030] [2025-03-17 11:58:41,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:41,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:41,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:41,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:41,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:58:41,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:58:41,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:58:41,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:41,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:41,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 11:58:41,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:41,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-17 11:58:41,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-03-17 11:58:41,105 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 10 treesize of output 8 [2025-03-17 11:58:41,120 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 13 treesize of output 9 [2025-03-17 11:58:41,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 11:58:41,207 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:58:41,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 11:58:41,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 11:58:41,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 31 treesize of output 13 [2025-03-17 11:58:41,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2025-03-17 11:58:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:41,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:41,370 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4)) (.cse0 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_219 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_219) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_219 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_219) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_218) c_create_data_~data~0.base) .cse0)))))) is different from false [2025-03-17 11:58:41,391 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_219 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_219) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_218) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_219 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_219) c_create_data_~data~0.base) .cse1) .cse2 4)))))) is different from false [2025-03-17 11:58:41,404 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_219 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_219) c_create_data_~data~0.base) .cse1) 4))) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_219 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_219) c_create_data_~data~0.base) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_218) c_create_data_~data~0.base) .cse1))))))) is different from false [2025-03-17 11:58:41,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:41,421 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 45 treesize of output 46 [2025-03-17 11:58:41,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:41,426 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 35 treesize of output 36 [2025-03-17 11:58:41,428 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 62 treesize of output 50 [2025-03-17 11:58:41,432 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 96 treesize of output 78 [2025-03-17 11:58:41,436 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 15 treesize of output 11 [2025-03-17 11:58:41,438 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 11 treesize of output 7 [2025-03-17 11:58:41,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:41,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-17 11:58:41,447 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:58:41,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-17 11:58:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-17 11:58:41,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961561030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:58:41,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:58:41,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 18 [2025-03-17 11:58:41,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333715220] [2025-03-17 11:58:41,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:41,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 11:58:41,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:41,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 11:58:41,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=189, Unknown=3, NotChecked=90, Total=342 [2025-03-17 11:58:41,468 INFO L87 Difference]: Start difference. First operand 207 states and 228 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:41,841 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2025-03-17 11:58:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:58:41,841 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 11:58:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:41,842 INFO L225 Difference]: With dead ends: 217 [2025-03-17 11:58:41,842 INFO L226 Difference]: Without dead ends: 217 [2025-03-17 11:58:41,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=235, Unknown=3, NotChecked=102, Total=420 [2025-03-17 11:58:41,842 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 8 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:41,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1042 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 536 Invalid, 0 Unknown, 241 Unchecked, 0.3s Time] [2025-03-17 11:58:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-17 11:58:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-17 11:58:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 162 states have (on average 1.4444444444444444) internal successors, (234), 212 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 238 transitions. [2025-03-17 11:58:41,846 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 238 transitions. Word has length 23 [2025-03-17 11:58:41,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:41,846 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 238 transitions. [2025-03-17 11:58:41,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 238 transitions. [2025-03-17 11:58:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 11:58:41,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:41,847 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:41,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:58:42,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 11:58:42,051 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:42,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:42,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1748266073, now seen corresponding path program 2 times [2025-03-17 11:58:42,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:42,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673017710] [2025-03-17 11:58:42,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:58:42,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:42,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-17 11:58:42,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:58:42,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:58:42,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:42,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:42,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673017710] [2025-03-17 11:58:42,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673017710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:42,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251871929] [2025-03-17 11:58:42,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:58:42,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:42,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:42,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:42,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:58:42,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-17 11:58:42,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:58:42,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:58:42,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:42,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 11:58:42,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:42,490 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 10 treesize of output 8 [2025-03-17 11:58:42,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-17 11:58:42,513 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 13 treesize of output 9 [2025-03-17 11:58:42,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 11:58:42,615 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:58:42,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 11:58:42,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 11:58:42,730 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:58:42,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 11:58:42,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 11:58:42,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 11:58:42,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2025-03-17 11:58:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:42,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:42,882 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4)) (.cse0 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_291 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_291) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_291) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_292) c_create_data_~data~0.base) .cse0)))))) is different from false [2025-03-17 11:58:42,897 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_291 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_291) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_291) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_292) c_create_data_~data~0.base) .cse2))))))) is different from false [2025-03-17 11:58:42,911 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int))) (<= (+ .cse0 12 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_291) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_292) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_291 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_291) c_create_data_~data~0.base) .cse2))))))) is different from false [2025-03-17 11:58:42,921 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_289 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_289))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_290) .cse1 v_ArrVal_291) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_292) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_289 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_290) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_289) c_create_data_~data~0.base) .cse2) v_ArrVal_291) c_create_data_~data~0.base) .cse2)))))) is different from false [2025-03-17 11:58:43,037 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_289 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_289))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_290) .cse1 v_ArrVal_291) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_292) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_289 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_290) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_289) c_create_data_~data~0.base) .cse2) v_ArrVal_291) c_create_data_~data~0.base) .cse2) 8)))))) is different from false [2025-03-17 11:58:43,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:43,054 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 89 treesize of output 90 [2025-03-17 11:58:43,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:43,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2025-03-17 11:58:43,069 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 400 treesize of output 334 [2025-03-17 11:58:43,074 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 288 treesize of output 264 [2025-03-17 11:58:43,082 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 23 treesize of output 19 [2025-03-17 11:58:43,085 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 19 treesize of output 15 [2025-03-17 11:58:43,087 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 28 [2025-03-17 11:58:43,095 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 16 treesize of output 12 [2025-03-17 11:58:43,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:43,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2025-03-17 11:58:43,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:43,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-03-17 11:58:43,120 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:58:43,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-17 11:58:43,124 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:58:43,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-17 11:58:43,149 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2025-03-17 11:58:43,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251871929] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:58:43,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:58:43,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 28 [2025-03-17 11:58:43,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405865727] [2025-03-17 11:58:43,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:43,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 11:58:43,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:43,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 11:58:43,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=453, Unknown=8, NotChecked=240, Total=812 [2025-03-17 11:58:43,150 INFO L87 Difference]: Start difference. First operand 217 states and 238 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:43,545 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse2)) (.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_291 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_291) c_create_data_~data~0.base) .cse2)))) (<= 0 (+ .cse3 .cse0)) (<= (+ .cse3 .cse0 4) (select |c_#length| .cse1)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_291) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_292) c_create_data_~data~0.base) .cse2))))))) is different from false [2025-03-17 11:58:43,550 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_create_data_~data~0.offset 4)) (.cse1 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_291 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_291) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_291) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_292) c_create_data_~data~0.base) .cse0)))) (<= 0 (+ |c_create_data_#t~mem8.offset| .cse1)) (<= (+ |c_create_data_#t~mem8.offset| .cse1 4) (select |c_#length| |c_create_data_#t~mem8.base|)))) is different from false [2025-03-17 11:58:43,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:43,932 INFO L93 Difference]: Finished difference Result 247 states and 272 transitions. [2025-03-17 11:58:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:58:43,932 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-17 11:58:43,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:43,933 INFO L225 Difference]: With dead ends: 247 [2025-03-17 11:58:43,933 INFO L226 Difference]: Without dead ends: 247 [2025-03-17 11:58:43,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=700, Unknown=14, NotChecked=434, Total=1332 [2025-03-17 11:58:43,934 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 18 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 2 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 586 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:43,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1402 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 757 Invalid, 24 Unknown, 586 Unchecked, 0.5s Time] [2025-03-17 11:58:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-17 11:58:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-03-17 11:58:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 192 states have (on average 1.3958333333333333) internal successors, (268), 242 states have internal predecessors, (268), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:43,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 272 transitions. [2025-03-17 11:58:43,942 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 272 transitions. Word has length 28 [2025-03-17 11:58:43,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:43,943 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 272 transitions. [2025-03-17 11:58:43,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:43,943 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 272 transitions. [2025-03-17 11:58:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 11:58:43,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:43,944 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:43,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 11:58:44,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:44,149 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:44,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:44,150 INFO L85 PathProgramCache]: Analyzing trace with hash -76073889, now seen corresponding path program 1 times [2025-03-17 11:58:44,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:44,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726700869] [2025-03-17 11:58:44,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:44,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:44,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:58:44,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:58:44,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:44,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:44,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:44,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726700869] [2025-03-17 11:58:44,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726700869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:44,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:44,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:44,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880500515] [2025-03-17 11:58:44,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:44,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:44,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:44,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:44,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:44,220 INFO L87 Difference]: Start difference. First operand 247 states and 272 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:44,287 INFO L93 Difference]: Finished difference Result 245 states and 268 transitions. [2025-03-17 11:58:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:44,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-17 11:58:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:44,289 INFO L225 Difference]: With dead ends: 245 [2025-03-17 11:58:44,289 INFO L226 Difference]: Without dead ends: 245 [2025-03-17 11:58:44,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:44,290 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:44,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 238 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-17 11:58:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-03-17 11:58:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 192 states have (on average 1.375) internal successors, (264), 240 states have internal predecessors, (264), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 268 transitions. [2025-03-17 11:58:44,295 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 268 transitions. Word has length 40 [2025-03-17 11:58:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:44,295 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 268 transitions. [2025-03-17 11:58:44,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 268 transitions. [2025-03-17 11:58:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 11:58:44,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:44,301 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:44,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:58:44,301 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:44,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash -76073888, now seen corresponding path program 1 times [2025-03-17 11:58:44,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:44,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448976598] [2025-03-17 11:58:44,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:44,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:44,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:58:44,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:58:44,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:44,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:44,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:44,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448976598] [2025-03-17 11:58:44,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448976598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:44,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173376888] [2025-03-17 11:58:44,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:44,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:44,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:44,377 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:44,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:58:44,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:58:44,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:58:44,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:44,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:44,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 11:58:44,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:44,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:44,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173376888] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:58:44,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:58:44,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-17 11:58:44,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370014707] [2025-03-17 11:58:44,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:44,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:58:44,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:44,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:58:44,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:58:44,554 INFO L87 Difference]: Start difference. First operand 245 states and 268 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:44,587 INFO L93 Difference]: Finished difference Result 269 states and 292 transitions. [2025-03-17 11:58:44,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:58:44,588 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-17 11:58:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:44,589 INFO L225 Difference]: With dead ends: 269 [2025-03-17 11:58:44,589 INFO L226 Difference]: Without dead ends: 269 [2025-03-17 11:58:44,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:58:44,590 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 8 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:44,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 622 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:58:44,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-17 11:58:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-03-17 11:58:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 216 states have (on average 1.3333333333333333) internal successors, (288), 264 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 292 transitions. [2025-03-17 11:58:44,597 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 292 transitions. Word has length 40 [2025-03-17 11:58:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:44,597 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 292 transitions. [2025-03-17 11:58:44,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 292 transitions. [2025-03-17 11:58:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 11:58:44,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:44,600 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:44,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 11:58:44,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 11:58:44,804 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:44,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:44,804 INFO L85 PathProgramCache]: Analyzing trace with hash -251682024, now seen corresponding path program 3 times [2025-03-17 11:58:44,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:44,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910848301] [2025-03-17 11:58:44,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:58:44,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:44,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 6 equivalence classes. [2025-03-17 11:58:44,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:58:44,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 11:58:44,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:45,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:45,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910848301] [2025-03-17 11:58:45,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910848301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:45,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982504203] [2025-03-17 11:58:45,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:58:45,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:45,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:45,733 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:45,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:58:45,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 6 equivalence classes. [2025-03-17 11:58:45,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:58:45,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 11:58:45,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:45,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 11:58:45,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:45,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-03-17 11:58:45,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-17 11:58:45,989 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 10 treesize of output 8 [2025-03-17 11:58:46,021 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 15 treesize of output 1 [2025-03-17 11:58:46,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 11:58:46,131 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:58:46,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 11:58:46,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 24 treesize of output 11 [2025-03-17 11:58:46,232 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:58:46,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 11:58:46,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 11:58:46,347 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:58:46,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 11:58:46,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 11:58:46,468 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:58:46,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 11:58:46,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-03-17 11:58:46,622 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:58:46,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 11:58:46,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 35 treesize of output 20 [2025-03-17 11:58:46,690 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 26 treesize of output 14 [2025-03-17 11:58:46,698 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 25 treesize of output 13 [2025-03-17 11:58:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:46,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:46,823 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_create_data_~data~0.offset 4)) (.cse1 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_545) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_544) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_545 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_545) c_create_data_~data~0.base) .cse0) .cse1 4))))) is different from false [2025-03-17 11:58:46,835 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_545) c_create_data_~data~0.base) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_544) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_545 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_545) c_create_data_~data~0.base) .cse2) 4)))))) is different from false [2025-03-17 11:58:46,847 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_545 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_545) c_create_data_~data~0.base) .cse2) 8))) (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_545) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_544) c_create_data_~data~0.base) .cse2))))))) is different from false [2025-03-17 11:58:47,317 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#2.offset| .cse5 v_ArrVal_541))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< c_create_data_~counter~0 (div (+ (- 1) (* (- 1) .cse0)) 4)) (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (< (+ (mod (+ (* 3 .cse0) 3) 4) .cse0) (+ (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse5 v_ArrVal_540))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store .cse1 .cse2 v_ArrVal_542) (select (select (store .cse3 .cse2 v_ArrVal_543) c_create_data_~data~0.base) .cse4) v_ArrVal_545))) c_create_data_~data~0.base) .cse4) 12))))))) (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse9 (* c_create_data_~counter~0 4)) (.cse6 (store |c_#memory_$Pointer$#2.offset| .cse5 v_ArrVal_541))) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse5 v_ArrVal_540))) (let ((.cse7 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_543))) (let ((.cse8 (select (select .cse10 c_create_data_~data~0.base) .cse4))) (< (+ (select (select (store (store .cse6 .cse7 v_ArrVal_542) .cse8 v_ArrVal_545) c_create_data_~data~0.base) .cse4) .cse9 15) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_544) c_create_data_~data~0.base) .cse4)))))))) (< (+ .cse9 4 (select (select .cse6 c_create_data_~data~0.base) .cse4)) 0))))))) is different from false [2025-03-17 11:58:47,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_539))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_538) .cse6 v_ArrVal_541))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ c_create_data_~counter~0 1) (div (+ (- 1) (* (- 1) .cse0)) 4)) (< (+ (mod (+ 3 (* 3 .cse0)) 4) .cse0) (+ (select (select (let ((.cse3 (store .cse5 .cse6 v_ArrVal_540))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store .cse1 .cse2 v_ArrVal_542) (select (select (store .cse3 .cse2 v_ArrVal_543) c_create_data_~data~0.base) .cse4) v_ArrVal_545))) c_create_data_~data~0.base) .cse4) 12)))))))) (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_539))) (let ((.cse14 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (* c_create_data_~counter~0 4)) (.cse7 (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_538) .cse14 v_ArrVal_541))) (or (let ((.cse12 (store .cse13 .cse14 v_ArrVal_540))) (let ((.cse8 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse12 .cse8 v_ArrVal_543))) (let ((.cse9 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (< (+ (select (select (store (store .cse7 .cse8 v_ArrVal_542) .cse9 v_ArrVal_545) c_create_data_~data~0.base) .cse4) 19 .cse10) (select |c_#length| (select (select (store .cse11 .cse9 v_ArrVal_544) c_create_data_~data~0.base) .cse4))))))) (< (+ .cse10 (select (select .cse7 c_create_data_~data~0.base) .cse4) 8) 0)))))))) is different from false [2025-03-17 11:58:47,683 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_539))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store |c_#memory_$Pointer$#2.offset| .cse7 v_ArrVal_538) .cse6 v_ArrVal_541))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ .cse0 (mod (+ (* .cse0 3) 3) 4)) (+ 12 (select (select (let ((.cse3 (store .cse5 .cse6 v_ArrVal_540))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store .cse1 .cse2 v_ArrVal_542) (select (select (store .cse3 .cse2 v_ArrVal_543) c_create_data_~data~0.base) .cse4) v_ArrVal_545))) c_create_data_~data~0.base) .cse4))) (< (+ c_create_data_~counter~0 1) (div (+ (- 1) (* (- 1) .cse0)) 4)))))))) (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_539))) (let ((.cse15 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse9 (store (store |c_#memory_$Pointer$#2.offset| .cse7 v_ArrVal_538) .cse15 v_ArrVal_541)) (.cse8 (* c_create_data_~counter~0 4))) (or (let ((.cse13 (store .cse14 .cse15 v_ArrVal_540))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_543))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (< (+ 19 .cse8 (select (select (store (store .cse9 .cse10 v_ArrVal_542) .cse11 v_ArrVal_545) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse12 .cse11 v_ArrVal_544) c_create_data_~data~0.base) .cse4))))))) (< (+ (select (select .cse9 c_create_data_~data~0.base) .cse4) .cse8 8) 0))))))))) is different from false [2025-03-17 11:58:47,753 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_539))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse1))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_538) .cse8 v_ArrVal_541))) (or (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2 12) 0) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_540))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse1))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_543))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse1))) (< (+ 23 .cse2 (select (select (store (store .cse0 .cse3 v_ArrVal_542) .cse4 v_ArrVal_545) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_544) c_create_data_~data~0.base) .cse1)))))))))))) (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_539))) (let ((.cse15 (select (select .cse14 c_create_data_~data~0.base) .cse1))) (let ((.cse11 (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_538) .cse15 v_ArrVal_541))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse1))) (or (< (+ c_create_data_~counter~0 2) (div (+ (- 1) (* (- 1) .cse10)) 4)) (< (+ .cse10 (mod (+ (* .cse10 3) 3) 4)) (+ 12 (select (select (let ((.cse13 (store .cse14 .cse15 v_ArrVal_540))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse1))) (store (store .cse11 .cse12 v_ArrVal_542) (select (select (store .cse13 .cse12 v_ArrVal_543) c_create_data_~data~0.base) .cse1) v_ArrVal_545))) c_create_data_~data~0.base) .cse1)))))))))))) is different from false [2025-03-17 11:58:47,932 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_536))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse8 .cse7 v_ArrVal_539))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_537) .cse7 v_ArrVal_538) .cse6 v_ArrVal_541))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ (mod (+ 3 (* 3 .cse0)) 4) .cse0) (+ (select (select (let ((.cse3 (store .cse5 .cse6 v_ArrVal_540))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store .cse1 .cse2 v_ArrVal_542) (select (select (store .cse3 .cse2 v_ArrVal_543) c_create_data_~data~0.base) .cse4) v_ArrVal_545))) c_create_data_~data~0.base) .cse4) 12)) (< (+ c_create_data_~counter~0 2) (div (+ (- 1) (* (- 1) .cse0)) 4)))))))))) (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_536))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse4))) (let ((.cse15 (store .cse18 .cse17 v_ArrVal_539))) (let ((.cse16 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (let ((.cse12 (* c_create_data_~counter~0 4)) (.cse9 (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_537) .cse17 v_ArrVal_538) .cse16 v_ArrVal_541))) (or (let ((.cse14 (store .cse15 .cse16 v_ArrVal_540))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse13 (store .cse14 .cse10 v_ArrVal_543))) (let ((.cse11 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (< (+ 23 (select (select (store (store .cse9 .cse10 v_ArrVal_542) .cse11 v_ArrVal_545) c_create_data_~data~0.base) .cse4) .cse12) (select |c_#length| (select (select (store .cse13 .cse11 v_ArrVal_544) c_create_data_~data~0.base) .cse4))))))) (< (+ .cse12 (select (select .cse9 c_create_data_~data~0.base) .cse4) 12) 0)))))))))) is different from false [2025-03-17 11:58:52,118 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_536))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse2))) (let ((.cse7 (store .cse11 .cse10 v_ArrVal_539))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_537) .cse10 v_ArrVal_538) .cse8 v_ArrVal_541)) (.cse0 (* c_create_data_~counter~0 4))) (or (< (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2) 12) 0) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_540))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_543))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (< (+ 23 (select (select (store (store .cse1 .cse3 v_ArrVal_542) .cse4 v_ArrVal_545) c_create_data_~data~0.base) .cse2) .cse0) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_544) c_create_data_~data~0.base) .cse2)))))))))))))) (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_536))) (let ((.cse18 (select (select .cse19 c_create_data_~data~0.base) .cse2))) (let ((.cse16 (store .cse19 .cse18 v_ArrVal_539))) (let ((.cse17 (select (select .cse16 c_create_data_~data~0.base) .cse2))) (let ((.cse13 (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_537) .cse18 v_ArrVal_538) .cse17 v_ArrVal_541))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse2))) (or (< (+ (mod (+ 3 (* 3 .cse12)) 4) .cse12) (+ (select (select (let ((.cse15 (store .cse16 .cse17 v_ArrVal_540))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse2))) (store (store .cse13 .cse14 v_ArrVal_542) (select (select (store .cse15 .cse14 v_ArrVal_543) c_create_data_~data~0.base) .cse2) v_ArrVal_545))) c_create_data_~data~0.base) .cse2) 12)) (< (+ c_create_data_~counter~0 2) (div (+ (- 1) (* (- 1) .cse12)) 4))))))))))))) is different from false [2025-03-17 11:58:52,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_536))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse3))) (let ((.cse6 (store .cse10 .cse9 v_ArrVal_539))) (let ((.cse7 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_537) .cse9 v_ArrVal_538) .cse7 v_ArrVal_541))) (or (let ((.cse5 (store .cse6 .cse7 v_ArrVal_540))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_543))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (< (+ 23 (select (select (store (store .cse0 .cse1 v_ArrVal_542) .cse2 v_ArrVal_545) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_544) c_create_data_~data~0.base) .cse3))))))) (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse3) 12) 0)))))))) (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_536))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse3))) (let ((.cse15 (store .cse18 .cse17 v_ArrVal_539))) (let ((.cse16 (select (select .cse15 c_create_data_~data~0.base) .cse3))) (let ((.cse12 (store (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_537) .cse17 v_ArrVal_538) .cse16 v_ArrVal_541))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse3))) (or (< (+ (mod (+ 3 (* 3 .cse11)) 4) .cse11) (+ (select (select (let ((.cse14 (store .cse15 .cse16 v_ArrVal_540))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse3))) (store (store .cse12 .cse13 v_ArrVal_542) (select (select (store .cse14 .cse13 v_ArrVal_543) c_create_data_~data~0.base) .cse3) v_ArrVal_545))) c_create_data_~data~0.base) .cse3) 12)) (< 2 (div (+ (- 1) (* (- 1) .cse11)) 4))))))))))))) is different from false [2025-03-17 11:58:52,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:52,301 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 796 treesize of output 786 [2025-03-17 11:58:52,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:52,311 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 776 treesize of output 446 [2025-03-17 11:58:52,707 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 47495253 treesize of output 41164461 [2025-03-17 11:59:00,163 WARN L286 SmtUtils]: Spent 7.44s on a formula simplification. DAG size of input: 5842 DAG size of output: 225 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 11:59:00,194 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 173012 treesize of output 171968 [2025-03-17 11:59:00,261 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 634 treesize of output 566 [2025-03-17 11:59:00,270 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 566 treesize of output 550 [2025-03-17 11:59:00,279 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 550 treesize of output 478 [2025-03-17 11:59:00,288 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 478 treesize of output 450 [2025-03-17 11:59:00,297 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 468 treesize of output 460 [2025-03-17 11:59:00,303 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 509 treesize of output 445 [2025-03-17 11:59:00,310 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 400 treesize of output 392 [2025-03-17 11:59:00,317 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 437 treesize of output 389 [2025-03-17 11:59:00,328 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 348 treesize of output 340 [2025-03-17 11:59:00,336 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 342 treesize of output 330 [2025-03-17 11:59:00,500 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 11:59:00,501 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 627 treesize of output 1 [2025-03-17 11:59:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 59 not checked. [2025-03-17 11:59:00,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982504203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:00,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:00,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 20] total 51 [2025-03-17 11:59:00,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38530493] [2025-03-17 11:59:00,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:00,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-17 11:59:00,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:00,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-17 11:59:00,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1474, Unknown=25, NotChecked=890, Total=2652 [2025-03-17 11:59:00,569 INFO L87 Difference]: Start difference. First operand 269 states and 292 transitions. Second operand has 52 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 52 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:08,594 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse0)) (.cse1 (* c_create_data_~counter~0 4))) (let ((.cse2 (+ .cse3 .cse1)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse0)) (.cse7 (+ |c_create_data_#t~mem8.offset| .cse1))) (and (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_545) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_544) c_create_data_~data~0.base) .cse0)))) (<= 0 .cse2) (<= (+ .cse3 .cse1 4) (select |c_#length| .cse4)) (or (< .cse2 0) (and (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse4 v_ArrVal_542) (select (select (store |c_#memory_$Pointer$#2.base| .cse4 v_ArrVal_543) c_create_data_~data~0.base) .cse0) v_ArrVal_545) c_create_data_~data~0.base) .cse0) .cse1 8))) (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse4 v_ArrVal_543))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse4 v_ArrVal_542) .cse5 v_ArrVal_545) c_create_data_~data~0.base) .cse0) .cse1 12) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_544) c_create_data_~data~0.base) .cse0)))))))) (forall ((v_ArrVal_545 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_545) c_create_data_~data~0.base) .cse0) .cse1 4))) (or (< .cse7 0) (and (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ .cse1 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_542) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_543) c_create_data_~data~0.base) .cse0) v_ArrVal_545) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_543))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse0))) (<= (+ .cse1 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_542) .cse8 v_ArrVal_545) c_create_data_~data~0.base) .cse0)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_544) c_create_data_~data~0.base) .cse0)))))))) (<= 0 .cse7) (<= (+ |c_create_data_#t~mem8.offset| .cse1 4) (select |c_#length| |c_create_data_#t~mem8.base|)))))) is different from false [2025-03-17 11:59:08,603 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4))) (let ((.cse0 (+ c_create_data_~data~0.offset 4)) (.cse2 (+ |c_create_data_#t~mem8.offset| .cse1))) (and (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_545) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_544) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_545 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_545) c_create_data_~data~0.base) .cse0) .cse1 4))) (or (< .cse2 0) (and (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ .cse1 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_542) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_543) c_create_data_~data~0.base) .cse0) v_ArrVal_545) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_543))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse0))) (<= (+ .cse1 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_542) .cse3 v_ArrVal_545) c_create_data_~data~0.base) .cse0)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_544) c_create_data_~data~0.base) .cse0)))))))) (<= 0 .cse2) (<= (+ |c_create_data_#t~mem8.offset| .cse1 4) (select |c_#length| |c_create_data_#t~mem8.base|))))) is different from false [2025-03-17 11:59:08,754 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse3)) (.cse1 (* c_create_data_~counter~0 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (<= 0 (+ .cse0 .cse1)) (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (<= (+ .cse1 (select (select (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_545) c_create_data_~data~0.base) .cse3) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_544) c_create_data_~data~0.base) .cse3)))) (<= (+ .cse0 .cse1 4) (select |c_#length| .cse2)) (forall ((v_ArrVal_545 (Array Int Int))) (<= 0 (+ .cse1 (select (select (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_545) c_create_data_~data~0.base) .cse3) 4)))))) is different from false [2025-03-17 11:59:08,760 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_create_data_~data~0.offset 4)) (.cse1 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_545) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_544) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_545 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_545) c_create_data_~data~0.base) .cse0) .cse1 4))) (<= 0 (+ |c_create_data_#t~mem8.offset| .cse1)) (<= (+ |c_create_data_#t~mem8.offset| .cse1 4) (select |c_#length| |c_create_data_#t~mem8.base|)))) is different from false [2025-03-17 11:59:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:10,035 INFO L93 Difference]: Finished difference Result 295 states and 318 transitions. [2025-03-17 11:59:10,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 11:59:10,038 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 52 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-17 11:59:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:10,039 INFO L225 Difference]: With dead ends: 295 [2025-03-17 11:59:10,039 INFO L226 Difference]: Without dead ends: 295 [2025-03-17 11:59:10,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=698, Invalid=3085, Unknown=55, NotChecked=1862, Total=5700 [2025-03-17 11:59:10,044 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 103 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 32 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 2690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 1465 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:10,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 2151 Invalid, 2690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1172 Invalid, 21 Unknown, 1465 Unchecked, 2.1s Time] [2025-03-17 11:59:10,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-17 11:59:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-03-17 11:59:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 242 states have (on average 1.2975206611570247) internal successors, (314), 290 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:59:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 318 transitions. [2025-03-17 11:59:10,057 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 318 transitions. Word has length 43 [2025-03-17 11:59:10,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:10,058 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 318 transitions. [2025-03-17 11:59:10,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 52 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:10,058 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 318 transitions. [2025-03-17 11:59:10,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 11:59:10,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:10,060 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:59:10,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 11:59:10,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 11:59:10,264 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:59:10,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:10,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1110891441, now seen corresponding path program 2 times [2025-03-17 11:59:10,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:10,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315289699] [2025-03-17 11:59:10,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:59:10,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:10,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-17 11:59:10,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 65 statements. [2025-03-17 11:59:10,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:59:10,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 11:59:10,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:10,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315289699] [2025-03-17 11:59:10,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315289699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:59:10,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:59:10,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:59:10,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184031394] [2025-03-17 11:59:10,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:59:10,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:59:10,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:10,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:59:10,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:59:10,336 INFO L87 Difference]: Start difference. First operand 295 states and 318 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:10,452 INFO L93 Difference]: Finished difference Result 293 states and 314 transitions. [2025-03-17 11:59:10,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:59:10,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-17 11:59:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:10,454 INFO L225 Difference]: With dead ends: 293 [2025-03-17 11:59:10,454 INFO L226 Difference]: Without dead ends: 293 [2025-03-17 11:59:10,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:59:10,454 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:10,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 239 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:59:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-17 11:59:10,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-17 11:59:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 242 states have (on average 1.28099173553719) internal successors, (310), 288 states have internal predecessors, (310), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:59:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 314 transitions. [2025-03-17 11:59:10,459 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 314 transitions. Word has length 65 [2025-03-17 11:59:10,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:10,459 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 314 transitions. [2025-03-17 11:59:10,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 314 transitions. [2025-03-17 11:59:10,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 11:59:10,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:10,461 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:59:10,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:59:10,461 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:59:10,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:10,461 INFO L85 PathProgramCache]: Analyzing trace with hash 166686247, now seen corresponding path program 4 times [2025-03-17 11:59:10,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:10,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164755079] [2025-03-17 11:59:10,462 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:59:10,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:10,476 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-03-17 11:59:10,542 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 11:59:10,542 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:59:10,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:12,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:12,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164755079] [2025-03-17 11:59:12,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164755079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:12,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808297166] [2025-03-17 11:59:12,541 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:59:12,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:12,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:12,543 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:12,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 11:59:12,626 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-03-17 11:59:13,015 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 11:59:13,015 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:59:13,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:13,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-17 11:59:13,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:13,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-03-17 11:59:13,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-17 11:59:13,066 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 10 treesize of output 8 [2025-03-17 11:59:13,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 11:59:13,136 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 19 treesize of output 1 [2025-03-17 11:59:13,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:59:13,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 49 [2025-03-17 11:59:13,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 11:59:13,594 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:59:13,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 11:59:13,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 11:59:13,786 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:59:13,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 11:59:13,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 11:59:13,982 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:59:13,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 11:59:13,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 30 treesize of output 13 [2025-03-17 11:59:14,261 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:59:14,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 11:59:14,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 11:59:14,456 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:59:14,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 11:59:14,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 11:59:14,640 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:59:14,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 11:59:14,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 11:59:14,841 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:59:14,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 11:59:14,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 11:59:15,044 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:59:15,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 76 [2025-03-17 11:59:15,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 16 [2025-03-17 11:59:15,309 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:59:15,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 11:59:15,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2025-03-17 11:59:15,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 11:59:15,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-03-17 11:59:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:15,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:20,589 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse5))) (let ((.cse8 (select |c_#memory_$Pointer$#2.offset| .cse7)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse5)) (.cse0 (+ c_create_data_~counter~0 1))) (and (forall ((v_create_data_~counter~0_50 Int)) (or (< .cse0 v_create_data_~counter~0_50) (forall ((|v_create_data_#t~mem8.offset_41| Int)) (let ((.cse2 (* v_create_data_~counter~0_50 4))) (let ((.cse9 (+ .cse2 |v_create_data_#t~mem8.offset_41|))) (or (< .cse1 |v_create_data_#t~mem8.offset_41|) (forall ((v_ArrVal_803 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| .cse7 (store .cse8 .cse9 v_ArrVal_803)))) (or (forall ((v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_804))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (<= (+ .cse2 12 (select (select (store .cse3 .cse4 v_ArrVal_807) c_create_data_~data~0.base) .cse5)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_806) c_create_data_~data~0.base) .cse5)))))) (< (+ (select (select .cse3 c_create_data_~data~0.base) .cse5) .cse2 4) 0)))) (< .cse9 0))))))) (forall ((v_create_data_~counter~0_50 Int)) (or (forall ((|v_create_data_#t~mem8.offset_41| Int)) (let ((.cse11 (* v_create_data_~counter~0_50 4))) (let ((.cse12 (+ .cse11 |v_create_data_#t~mem8.offset_41|))) (or (forall ((v_ArrVal_803 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.offset| .cse7 (store .cse8 .cse12 v_ArrVal_803)))) (or (< (+ (select (select .cse10 c_create_data_~data~0.base) .cse5) .cse11 4) 0) (forall ((v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (<= 0 (+ .cse11 8 (select (select (store .cse10 (select (select (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_804) c_create_data_~data~0.base) .cse5) v_ArrVal_807) c_create_data_~data~0.base) .cse5))))))) (< .cse1 |v_create_data_#t~mem8.offset_41|) (< .cse12 0))))) (< .cse0 v_create_data_~counter~0_50))))))) is different from false [2025-03-17 11:59:20,699 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4)) (.cse7 (+ c_create_data_~counter~0 1))) (and (forall ((v_ArrVal_801 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int))) (or (forall ((|v_create_data_#t~mem8.offset_41| Int)) (let ((.cse3 (* v_create_data_~counter~0_50 4))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_801)) (.cse2 (+ .cse3 |v_create_data_#t~mem8.offset_41|))) (or (< (select (select .cse0 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< .cse2 0) (forall ((v_ArrVal_803 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_802))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse1))) (let ((.cse4 (store .cse0 .cse6 (store (select .cse0 .cse6) .cse2 v_ArrVal_803)))) (or (forall ((v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (<= 0 (+ .cse3 8 (select (select (store .cse4 (select (select (store .cse5 .cse6 v_ArrVal_804) c_create_data_~data~0.base) .cse1) v_ArrVal_807) c_create_data_~data~0.base) .cse1)))) (< (+ .cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1) 4) 0)))))))))) (< .cse7 v_create_data_~counter~0_50))) (forall ((v_ArrVal_801 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int))) (or (forall ((|v_create_data_#t~mem8.offset_41| Int)) (let ((.cse8 (* v_create_data_~counter~0_50 4))) (let ((.cse14 (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_801)) (.cse15 (+ .cse8 |v_create_data_#t~mem8.offset_41|))) (or (forall ((v_ArrVal_803 Int)) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_802))) (let ((.cse13 (select (select .cse12 c_create_data_~data~0.base) .cse1))) (let ((.cse9 (store .cse14 .cse13 (store (select .cse14 .cse13) .cse15 v_ArrVal_803)))) (or (< (+ .cse8 (select (select .cse9 c_create_data_~data~0.base) .cse1) 4) 0) (forall ((v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse11 (store .cse12 .cse13 v_ArrVal_804))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse1))) (<= (+ .cse8 12 (select (select (store .cse9 .cse10 v_ArrVal_807) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_806) c_create_data_~data~0.base) .cse1))))))))))) (< (select (select .cse14 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< .cse15 0))))) (< .cse7 v_create_data_~counter~0_50))))) is different from false [2025-03-17 11:59:20,912 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3)) (.cse8 (+ c_create_data_~counter~0 1))) (and (forall ((v_ArrVal_801 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int))) (or (forall ((|v_create_data_#t~mem8.offset_41| Int)) (let ((.cse1 (* v_create_data_~counter~0_50 4))) (let ((.cse0 (+ .cse1 |v_create_data_#t~mem8.offset_41|)) (.cse6 (store |c_#memory_$Pointer$#2.offset| .cse7 v_ArrVal_801))) (or (< .cse0 0) (forall ((v_ArrVal_803 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_802))) (let ((.cse5 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (let ((.cse2 (store .cse6 .cse5 (store (select .cse6 .cse5) .cse0 v_ArrVal_803)))) (or (< (+ .cse1 (select (select .cse2 c_create_data_~data~0.base) .cse3) 4) 0) (forall ((v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (<= 0 (+ (select (select (store .cse2 (select (select (store .cse4 .cse5 v_ArrVal_804) c_create_data_~data~0.base) .cse3) v_ArrVal_807) c_create_data_~data~0.base) .cse3) .cse1 8)))))))) (< (select (select .cse6 c_create_data_~data~0.base) .cse3) |v_create_data_#t~mem8.offset_41|))))) (< .cse8 v_create_data_~counter~0_50))) (forall ((v_ArrVal_801 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int))) (or (forall ((|v_create_data_#t~mem8.offset_41| Int)) (let ((.cse9 (* v_create_data_~counter~0_50 4))) (let ((.cse16 (+ .cse9 |v_create_data_#t~mem8.offset_41|)) (.cse15 (store |c_#memory_$Pointer$#2.offset| .cse7 v_ArrVal_801))) (or (forall ((v_ArrVal_803 Int)) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_802))) (let ((.cse14 (select (select .cse13 c_create_data_~data~0.base) .cse3))) (let ((.cse10 (store .cse15 .cse14 (store (select .cse15 .cse14) .cse16 v_ArrVal_803)))) (or (< (+ .cse9 (select (select .cse10 c_create_data_~data~0.base) .cse3) 4) 0) (forall ((v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse12 (store .cse13 .cse14 v_ArrVal_804))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store .cse10 .cse11 v_ArrVal_807) c_create_data_~data~0.base) .cse3) .cse9 12) (select |c_#length| (select (select (store .cse12 .cse11 v_ArrVal_806) c_create_data_~data~0.base) .cse3))))))))))) (< .cse16 0) (< (select (select .cse15 c_create_data_~data~0.base) .cse3) |v_create_data_#t~mem8.offset_41|))))) (< .cse8 v_create_data_~counter~0_50)))))) is different from false [2025-03-17 11:59:21,092 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse8 (+ c_create_data_~counter~0 2)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_ArrVal_801 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_803 Int)) (let ((.cse0 (* v_create_data_~counter~0_50 4)) (.cse5 (store |c_#memory_$Pointer$#2.base| .cse10 v_ArrVal_802))) (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| .cse10 v_ArrVal_801)) (.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse2)) (.cse7 (+ .cse0 |v_create_data_#t~mem8.offset_41|))) (let ((.cse1 (store .cse9 .cse6 (store (select .cse9 .cse6) .cse7 v_ArrVal_803)))) (or (< (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2) 4) 0) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_804))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (< (+ (select (select (store .cse1 .cse3 v_ArrVal_807) c_create_data_~data~0.base) .cse2) .cse0 11) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_806) c_create_data_~data~0.base) .cse2))))) (< .cse7 0) (< .cse8 v_create_data_~counter~0_50) (< (select (select .cse9 c_create_data_~data~0.base) .cse2) |v_create_data_#t~mem8.offset_41|)))))) (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_ArrVal_801 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_803 Int)) (let ((.cse11 (* v_create_data_~counter~0_50 4)) (.cse15 (store |c_#memory_$Pointer$#2.base| .cse10 v_ArrVal_802))) (let ((.cse14 (store |c_#memory_$Pointer$#2.offset| .cse10 v_ArrVal_801)) (.cse16 (select (select .cse15 c_create_data_~data~0.base) .cse2)) (.cse13 (+ .cse11 |v_create_data_#t~mem8.offset_41|))) (let ((.cse12 (store .cse14 .cse16 (store (select .cse14 .cse16) .cse13 v_ArrVal_803)))) (or (< (+ .cse11 (select (select .cse12 c_create_data_~data~0.base) .cse2) 4) 0) (< .cse13 0) (< .cse8 v_create_data_~counter~0_50) (< (select (select .cse14 c_create_data_~data~0.base) .cse2) |v_create_data_#t~mem8.offset_41|) (< 0 (+ (select (select (store .cse12 (select (select (store .cse15 .cse16 v_ArrVal_804) c_create_data_~data~0.base) .cse2) v_ArrVal_807) c_create_data_~data~0.base) .cse2) 9 .cse11)))))))))) is different from false [2025-03-17 11:59:21,196 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_create_data_~counter~0 2)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_799 (Array Int Int)) (|v_create_data_#t~mem8.offset_41| Int) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_803 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_799))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (* v_create_data_~counter~0_50 4)) (.cse5 (store .cse11 .cse10 v_ArrVal_802))) (let ((.cse9 (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_800) .cse10 v_ArrVal_801)) (.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse2)) (.cse7 (+ .cse3 |v_create_data_#t~mem8.offset_41|))) (let ((.cse0 (store .cse9 .cse6 (store (select .cse9 .cse6) .cse7 v_ArrVal_803)))) (or (let ((.cse4 (store .cse5 .cse6 v_ArrVal_804))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (< (+ (select (select (store .cse0 .cse1 v_ArrVal_807) c_create_data_~data~0.base) .cse2) .cse3 11) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_806) c_create_data_~data~0.base) .cse2))))) (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse2) .cse3 4) 0) (< .cse7 0) (< .cse8 v_create_data_~counter~0_50) (< (select (select .cse9 c_create_data_~data~0.base) .cse2) |v_create_data_#t~mem8.offset_41|)))))))) (forall ((v_ArrVal_799 (Array Int Int)) (|v_create_data_#t~mem8.offset_41| Int) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_803 Int)) (let ((.cse19 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_799))) (let ((.cse18 (select (select .cse19 c_create_data_~data~0.base) .cse2))) (let ((.cse13 (* v_create_data_~counter~0_50 4)) (.cse15 (store .cse19 .cse18 v_ArrVal_802))) (let ((.cse17 (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_800) .cse18 v_ArrVal_801)) (.cse16 (select (select .cse15 c_create_data_~data~0.base) .cse2)) (.cse14 (+ .cse13 |v_create_data_#t~mem8.offset_41|))) (let ((.cse12 (store .cse17 .cse16 (store (select .cse17 .cse16) .cse14 v_ArrVal_803)))) (or (< (+ (select (select .cse12 c_create_data_~data~0.base) .cse2) .cse13 4) 0) (< .cse14 0) (< .cse8 v_create_data_~counter~0_50) (< 0 (+ (select (select (store .cse12 (select (select (store .cse15 .cse16 v_ArrVal_804) c_create_data_~data~0.base) .cse2) v_ArrVal_807) c_create_data_~data~0.base) .cse2) 9 .cse13)) (< (select (select .cse17 c_create_data_~data~0.base) .cse2) |v_create_data_#t~mem8.offset_41|)))))))))) is different from false [2025-03-17 11:59:21,360 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (+ c_create_data_~counter~0 2)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_799 (Array Int Int)) (|v_create_data_#t~mem8.offset_41| Int) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_803 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_799))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse1))) (let ((.cse2 (* v_create_data_~counter~0_50 4)) (.cse3 (store .cse10 .cse9 v_ArrVal_802))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_800) .cse9 v_ArrVal_801)) (.cse4 (select (select .cse3 c_create_data_~data~0.base) .cse1)) (.cse6 (+ .cse2 |v_create_data_#t~mem8.offset_41|))) (let ((.cse0 (store .cse5 .cse4 (store (select .cse5 .cse4) .cse6 v_ArrVal_803)))) (or (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2 4) 0) (< 0 (+ (select (select (store .cse0 (select (select (store .cse3 .cse4 v_ArrVal_804) c_create_data_~data~0.base) .cse1) v_ArrVal_807) c_create_data_~data~0.base) .cse1) 9 .cse2)) (< (select (select .cse5 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< .cse6 0) (< .cse7 v_create_data_~counter~0_50)))))))) (forall ((v_ArrVal_799 (Array Int Int)) (|v_create_data_#t~mem8.offset_41| Int) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_803 Int)) (let ((.cse20 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_799))) (let ((.cse19 (select (select .cse20 c_create_data_~data~0.base) .cse1))) (let ((.cse12 (* v_create_data_~counter~0_50 4)) (.cse16 (store .cse20 .cse19 v_ArrVal_802))) (let ((.cse13 (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_800) .cse19 v_ArrVal_801)) (.cse17 (select (select .cse16 c_create_data_~data~0.base) .cse1)) (.cse18 (+ .cse12 |v_create_data_#t~mem8.offset_41|))) (let ((.cse11 (store .cse13 .cse17 (store (select .cse13 .cse17) .cse18 v_ArrVal_803)))) (or (< (+ (select (select .cse11 c_create_data_~data~0.base) .cse1) .cse12 4) 0) (< (select (select .cse13 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (let ((.cse15 (store .cse16 .cse17 v_ArrVal_804))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse1))) (< (+ (select (select (store .cse11 .cse14 v_ArrVal_807) c_create_data_~data~0.base) .cse1) .cse12 11) (select |c_#length| (select (select (store .cse15 .cse14 v_ArrVal_806) c_create_data_~data~0.base) .cse1))))) (< .cse18 0) (< .cse7 v_create_data_~counter~0_50))))))))))) is different from false [2025-03-17 11:59:21,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (+ c_create_data_~counter~0 3)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_799 (Array Int Int)) (|v_create_data_#t~mem8.offset_41| Int) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_803 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_799))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse1))) (let ((.cse2 (* v_create_data_~counter~0_50 4)) (.cse3 (store .cse10 .cse9 v_ArrVal_802))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_800) .cse9 v_ArrVal_801)) (.cse4 (select (select .cse3 c_create_data_~data~0.base) .cse1)) (.cse6 (+ .cse2 |v_create_data_#t~mem8.offset_41|))) (let ((.cse0 (store .cse5 .cse4 (store (select .cse5 .cse4) .cse6 v_ArrVal_803)))) (or (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2 4) 0) (< 0 (+ (select (select (store .cse0 (select (select (store .cse3 .cse4 v_ArrVal_804) c_create_data_~data~0.base) .cse1) v_ArrVal_807) c_create_data_~data~0.base) .cse1) 9 .cse2)) (< (select (select .cse5 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< .cse6 0) (< .cse7 v_create_data_~counter~0_50)))))))) (forall ((v_ArrVal_799 (Array Int Int)) (|v_create_data_#t~mem8.offset_41| Int) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_803 Int)) (let ((.cse20 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_799))) (let ((.cse19 (select (select .cse20 c_create_data_~data~0.base) .cse1))) (let ((.cse12 (* v_create_data_~counter~0_50 4)) (.cse16 (store .cse20 .cse19 v_ArrVal_802))) (let ((.cse13 (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_800) .cse19 v_ArrVal_801)) (.cse17 (select (select .cse16 c_create_data_~data~0.base) .cse1)) (.cse18 (+ .cse12 |v_create_data_#t~mem8.offset_41|))) (let ((.cse11 (store .cse13 .cse17 (store (select .cse13 .cse17) .cse18 v_ArrVal_803)))) (or (< (+ (select (select .cse11 c_create_data_~data~0.base) .cse1) .cse12 4) 0) (< (select (select .cse13 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (let ((.cse15 (store .cse16 .cse17 v_ArrVal_804))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse1))) (< (+ (select (select (store .cse11 .cse14 v_ArrVal_807) c_create_data_~data~0.base) .cse1) .cse12 11) (select |c_#length| (select (select (store .cse15 .cse14 v_ArrVal_806) c_create_data_~data~0.base) .cse1))))) (< .cse18 0) (< .cse7 v_create_data_~counter~0_50))))))))))) is different from false [2025-03-17 11:59:21,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_create_data_~counter~0 3)) (.cse3 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (|v_create_data_#t~mem8.offset_41| Int) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_798))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_799))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (* v_create_data_~counter~0_50 4)) (.cse1 (store .cse10 .cse9 v_ArrVal_802))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_797) .cse8 v_ArrVal_800) .cse9 v_ArrVal_801)) (.cse2 (select (select .cse1 c_create_data_~data~0.base) .cse3)) (.cse6 (+ .cse4 |v_create_data_#t~mem8.offset_41|))) (let ((.cse0 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse6 v_ArrVal_803)))) (or (< 0 (+ 9 (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_804) c_create_data_~data~0.base) .cse3) v_ArrVal_807) c_create_data_~data~0.base) .cse3) .cse4)) (< (select (select .cse5 c_create_data_~data~0.base) .cse3) |v_create_data_#t~mem8.offset_41|) (< .cse6 0) (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse3) .cse4 4) 0) (< .cse7 v_create_data_~counter~0_50)))))))))) (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (|v_create_data_#t~mem8.offset_41| Int) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_798))) (let ((.cse20 (select (select .cse23 c_create_data_~data~0.base) .cse3))) (let ((.cse22 (store .cse23 .cse20 v_ArrVal_799))) (let ((.cse21 (select (select .cse22 c_create_data_~data~0.base) .cse3))) (let ((.cse15 (* v_create_data_~counter~0_50 4)) (.cse18 (store .cse22 .cse21 v_ArrVal_802))) (let ((.cse12 (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_797) .cse20 v_ArrVal_800) .cse21 v_ArrVal_801)) (.cse19 (select (select .cse18 c_create_data_~data~0.base) .cse3)) (.cse13 (+ .cse15 |v_create_data_#t~mem8.offset_41|))) (let ((.cse14 (store .cse12 .cse19 (store (select .cse12 .cse19) .cse13 v_ArrVal_803)))) (or (< (select (select .cse12 c_create_data_~data~0.base) .cse3) |v_create_data_#t~mem8.offset_41|) (< .cse13 0) (< (+ (select (select .cse14 c_create_data_~data~0.base) .cse3) .cse15 4) 0) (< .cse7 v_create_data_~counter~0_50) (let ((.cse17 (store .cse18 .cse19 v_ArrVal_804))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse3))) (< (+ (select (select (store .cse14 .cse16 v_ArrVal_807) c_create_data_~data~0.base) .cse3) .cse15 11) (select |c_#length| (select (select (store .cse17 .cse16 v_ArrVal_806) c_create_data_~data~0.base) .cse3)))))))))))))))) is different from false [2025-03-17 11:59:21,854 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse9 (+ c_create_data_~counter~0 3)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (|v_create_data_#t~mem8.offset_41| Int) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| .cse10 v_ArrVal_798))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse3))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_799))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse3))) (let ((.cse0 (* v_create_data_~counter~0_50 4)) (.cse5 (store .cse13 .cse12 v_ArrVal_802))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#2.offset| .cse10 v_ArrVal_797) .cse11 v_ArrVal_800) .cse12 v_ArrVal_801)) (.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse3)) (.cse8 (+ .cse0 |v_create_data_#t~mem8.offset_41|))) (let ((.cse1 (store .cse7 .cse6 (store (select .cse7 .cse6) .cse8 v_ArrVal_803)))) (or (let ((.cse4 (store .cse5 .cse6 v_ArrVal_804))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (< (+ .cse0 (select (select (store .cse1 .cse2 v_ArrVal_807) c_create_data_~data~0.base) .cse3) 11) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_806) c_create_data_~data~0.base) .cse3))))) (< (select (select .cse7 c_create_data_~data~0.base) .cse3) |v_create_data_#t~mem8.offset_41|) (< .cse8 0) (< .cse9 v_create_data_~counter~0_50) (< (+ (select (select .cse1 c_create_data_~data~0.base) .cse3) .cse0 4) 0)))))))))) (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (|v_create_data_#t~mem8.offset_41| Int) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#2.base| .cse10 v_ArrVal_798))) (let ((.cse21 (select (select .cse24 c_create_data_~data~0.base) .cse3))) (let ((.cse23 (store .cse24 .cse21 v_ArrVal_799))) (let ((.cse22 (select (select .cse23 c_create_data_~data~0.base) .cse3))) (let ((.cse15 (* v_create_data_~counter~0_50 4)) (.cse17 (store .cse23 .cse22 v_ArrVal_802))) (let ((.cse19 (store (store (store |c_#memory_$Pointer$#2.offset| .cse10 v_ArrVal_797) .cse21 v_ArrVal_800) .cse22 v_ArrVal_801)) (.cse18 (select (select .cse17 c_create_data_~data~0.base) .cse3)) (.cse20 (+ .cse15 |v_create_data_#t~mem8.offset_41|))) (let ((.cse16 (store .cse19 .cse18 (store (select .cse19 .cse18) .cse20 v_ArrVal_803)))) (or (< 0 (+ 9 .cse15 (select (select (store .cse16 (select (select (store .cse17 .cse18 v_ArrVal_804) c_create_data_~data~0.base) .cse3) v_ArrVal_807) c_create_data_~data~0.base) .cse3))) (< (select (select .cse19 c_create_data_~data~0.base) .cse3) |v_create_data_#t~mem8.offset_41|) (< .cse20 0) (< .cse9 v_create_data_~counter~0_50) (< (+ (select (select .cse16 c_create_data_~data~0.base) .cse3) .cse15 4) 0))))))))))))) is different from false [2025-03-17 11:59:22,101 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse9 (+ c_create_data_~counter~0 4)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (|v_create_data_#t~mem8.offset_41| Int) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| .cse10 v_ArrVal_798))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse3))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_799))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse3))) (let ((.cse0 (* v_create_data_~counter~0_50 4)) (.cse5 (store .cse13 .cse12 v_ArrVal_802))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#2.offset| .cse10 v_ArrVal_797) .cse11 v_ArrVal_800) .cse12 v_ArrVal_801)) (.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse3)) (.cse8 (+ .cse0 |v_create_data_#t~mem8.offset_41|))) (let ((.cse1 (store .cse7 .cse6 (store (select .cse7 .cse6) .cse8 v_ArrVal_803)))) (or (let ((.cse4 (store .cse5 .cse6 v_ArrVal_804))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (< (+ .cse0 (select (select (store .cse1 .cse2 v_ArrVal_807) c_create_data_~data~0.base) .cse3) 11) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_806) c_create_data_~data~0.base) .cse3))))) (< (select (select .cse7 c_create_data_~data~0.base) .cse3) |v_create_data_#t~mem8.offset_41|) (< .cse8 0) (< .cse9 v_create_data_~counter~0_50) (< (+ (select (select .cse1 c_create_data_~data~0.base) .cse3) .cse0 4) 0)))))))))) (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (|v_create_data_#t~mem8.offset_41| Int) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_create_data_~counter~0_50 Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#2.base| .cse10 v_ArrVal_798))) (let ((.cse21 (select (select .cse24 c_create_data_~data~0.base) .cse3))) (let ((.cse23 (store .cse24 .cse21 v_ArrVal_799))) (let ((.cse22 (select (select .cse23 c_create_data_~data~0.base) .cse3))) (let ((.cse15 (* v_create_data_~counter~0_50 4)) (.cse17 (store .cse23 .cse22 v_ArrVal_802))) (let ((.cse19 (store (store (store |c_#memory_$Pointer$#2.offset| .cse10 v_ArrVal_797) .cse21 v_ArrVal_800) .cse22 v_ArrVal_801)) (.cse18 (select (select .cse17 c_create_data_~data~0.base) .cse3)) (.cse20 (+ .cse15 |v_create_data_#t~mem8.offset_41|))) (let ((.cse16 (store .cse19 .cse18 (store (select .cse19 .cse18) .cse20 v_ArrVal_803)))) (or (< 0 (+ 9 .cse15 (select (select (store .cse16 (select (select (store .cse17 .cse18 v_ArrVal_804) c_create_data_~data~0.base) .cse3) v_ArrVal_807) c_create_data_~data~0.base) .cse3))) (< (select (select .cse19 c_create_data_~data~0.base) .cse3) |v_create_data_#t~mem8.offset_41|) (< .cse20 0) (< .cse9 v_create_data_~counter~0_50) (< (+ (select (select .cse16 c_create_data_~data~0.base) .cse3) .cse15 4) 0))))))))))))) is different from false [2025-03-17 11:59:22,212 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_803 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_795))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse2))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_798))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse2))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_799))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (* v_create_data_~counter~0_50 4)) (.cse5 (store .cse13 .cse12 v_ArrVal_802))) (let ((.cse9 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_796) .cse10 v_ArrVal_797) .cse11 v_ArrVal_800) .cse12 v_ArrVal_801)) (.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse2)) (.cse7 (+ .cse3 |v_create_data_#t~mem8.offset_41|))) (let ((.cse0 (store .cse9 .cse6 (store (select .cse9 .cse6) .cse7 v_ArrVal_803)))) (or (let ((.cse4 (store .cse5 .cse6 v_ArrVal_804))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (< (+ (select (select (store .cse0 .cse1 v_ArrVal_807) c_create_data_~data~0.base) .cse2) .cse3 11) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_806) c_create_data_~data~0.base) .cse2))))) (< (+ .cse3 (select (select .cse0 c_create_data_~data~0.base) .cse2) 4) 0) (< .cse7 0) (< .cse8 v_create_data_~counter~0_50) (< (select (select .cse9 c_create_data_~data~0.base) .cse2) |v_create_data_#t~mem8.offset_41|)))))))))))) (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_803 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_795))) (let ((.cse22 (select (select .cse27 c_create_data_~data~0.base) .cse2))) (let ((.cse26 (store .cse27 .cse22 v_ArrVal_798))) (let ((.cse23 (select (select .cse26 c_create_data_~data~0.base) .cse2))) (let ((.cse25 (store .cse26 .cse23 v_ArrVal_799))) (let ((.cse24 (select (select .cse25 c_create_data_~data~0.base) .cse2))) (let ((.cse16 (* v_create_data_~counter~0_50 4)) (.cse19 (store .cse25 .cse24 v_ArrVal_802))) (let ((.cse21 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_796) .cse22 v_ArrVal_797) .cse23 v_ArrVal_800) .cse24 v_ArrVal_801)) (.cse20 (select (select .cse19 c_create_data_~data~0.base) .cse2)) (.cse18 (+ .cse16 |v_create_data_#t~mem8.offset_41|))) (let ((.cse17 (store .cse21 .cse20 (store (select .cse21 .cse20) .cse18 v_ArrVal_803)))) (or (< (+ .cse16 (select (select .cse17 c_create_data_~data~0.base) .cse2) 4) 0) (< .cse18 0) (< .cse8 v_create_data_~counter~0_50) (< 0 (+ 9 (select (select (store .cse17 (select (select (store .cse19 .cse20 v_ArrVal_804) c_create_data_~data~0.base) .cse2) v_ArrVal_807) c_create_data_~data~0.base) .cse2) .cse16)) (< (select (select .cse21 c_create_data_~data~0.base) .cse2) |v_create_data_#t~mem8.offset_41|)))))))))))))) is different from false [2025-03-17 11:59:22,415 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse1 (+ c_create_data_~counter~0 4)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_803 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| .cse10 v_ArrVal_795))) (let ((.cse11 (select (select .cse16 c_create_data_~data~0.base) .cse3))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_798))) (let ((.cse12 (select (select .cse15 c_create_data_~data~0.base) .cse3))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_799))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (* v_create_data_~counter~0_50 4)) (.cse8 (store .cse14 .cse13 v_ArrVal_802))) (let ((.cse2 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse10 v_ArrVal_796) .cse11 v_ArrVal_797) .cse12 v_ArrVal_800) .cse13 v_ArrVal_801)) (.cse9 (select (select .cse8 c_create_data_~data~0.base) .cse3)) (.cse0 (+ .cse4 |v_create_data_#t~mem8.offset_41|))) (let ((.cse5 (store .cse2 .cse9 (store (select .cse2 .cse9) .cse0 v_ArrVal_803)))) (or (< .cse0 0) (< .cse1 v_create_data_~counter~0_50) (< (select (select .cse2 c_create_data_~data~0.base) .cse3) |v_create_data_#t~mem8.offset_41|) (let ((.cse7 (store .cse8 .cse9 v_ArrVal_804))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (< (+ .cse4 11 (select (select (store .cse5 .cse6 v_ArrVal_807) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_806) c_create_data_~data~0.base) .cse3))))) (< (+ (select (select .cse5 c_create_data_~data~0.base) .cse3) .cse4 4) 0)))))))))))) (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_803 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#2.base| .cse10 v_ArrVal_795))) (let ((.cse23 (select (select .cse28 c_create_data_~data~0.base) .cse3))) (let ((.cse27 (store .cse28 .cse23 v_ArrVal_798))) (let ((.cse24 (select (select .cse27 c_create_data_~data~0.base) .cse3))) (let ((.cse26 (store .cse27 .cse24 v_ArrVal_799))) (let ((.cse25 (select (select .cse26 c_create_data_~data~0.base) .cse3))) (let ((.cse18 (* v_create_data_~counter~0_50 4)) (.cse20 (store .cse26 .cse25 v_ArrVal_802))) (let ((.cse22 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse10 v_ArrVal_796) .cse23 v_ArrVal_797) .cse24 v_ArrVal_800) .cse25 v_ArrVal_801)) (.cse21 (select (select .cse20 c_create_data_~data~0.base) .cse3)) (.cse17 (+ .cse18 |v_create_data_#t~mem8.offset_41|))) (let ((.cse19 (store .cse22 .cse21 (store (select .cse22 .cse21) .cse17 v_ArrVal_803)))) (or (< .cse17 0) (< 0 (+ 9 .cse18 (select (select (store .cse19 (select (select (store .cse20 .cse21 v_ArrVal_804) c_create_data_~data~0.base) .cse3) v_ArrVal_807) c_create_data_~data~0.base) .cse3))) (< .cse1 v_create_data_~counter~0_50) (< (select (select .cse22 c_create_data_~data~0.base) .cse3) |v_create_data_#t~mem8.offset_41|) (< (+ (select (select .cse19 c_create_data_~data~0.base) .cse3) .cse18 4) 0))))))))))))))) is different from false [2025-03-17 11:59:22,863 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (+ c_create_data_~counter~0 5)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse5))) (and (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_803 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_795))) (let ((.cse9 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_798))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_799))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse5))) (let ((.cse1 (* v_create_data_~counter~0_50 4)) (.cse3 (store .cse12 .cse11 v_ArrVal_802))) (let ((.cse6 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_796) .cse9 v_ArrVal_797) .cse10 v_ArrVal_800) .cse11 v_ArrVal_801)) (.cse4 (select (select .cse3 c_create_data_~data~0.base) .cse5)) (.cse0 (+ .cse1 |v_create_data_#t~mem8.offset_41|))) (let ((.cse2 (store .cse6 .cse4 (store (select .cse6 .cse4) .cse0 v_ArrVal_803)))) (or (< .cse0 0) (< 0 (+ 9 .cse1 (select (select (store .cse2 (select (select (store .cse3 .cse4 v_ArrVal_804) c_create_data_~data~0.base) .cse5) v_ArrVal_807) c_create_data_~data~0.base) .cse5))) (< (select (select .cse6 c_create_data_~data~0.base) .cse5) |v_create_data_#t~mem8.offset_41|) (< .cse7 v_create_data_~counter~0_50) (< (+ (select (select .cse2 c_create_data_~data~0.base) .cse5) .cse1 4) 0)))))))))))) (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_803 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_795))) (let ((.cse23 (select (select .cse28 c_create_data_~data~0.base) .cse5))) (let ((.cse27 (store .cse28 .cse23 v_ArrVal_798))) (let ((.cse24 (select (select .cse27 c_create_data_~data~0.base) .cse5))) (let ((.cse26 (store .cse27 .cse24 v_ArrVal_799))) (let ((.cse25 (select (select .cse26 c_create_data_~data~0.base) .cse5))) (let ((.cse17 (* v_create_data_~counter~0_50 4)) (.cse21 (store .cse26 .cse25 v_ArrVal_802))) (let ((.cse16 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_796) .cse23 v_ArrVal_797) .cse24 v_ArrVal_800) .cse25 v_ArrVal_801)) (.cse22 (select (select .cse21 c_create_data_~data~0.base) .cse5)) (.cse15 (+ .cse17 |v_create_data_#t~mem8.offset_41|))) (let ((.cse18 (store .cse16 .cse22 (store (select .cse16 .cse22) .cse15 v_ArrVal_803)))) (or (< .cse15 0) (< (select (select .cse16 c_create_data_~data~0.base) .cse5) |v_create_data_#t~mem8.offset_41|) (let ((.cse20 (store .cse21 .cse22 v_ArrVal_804))) (let ((.cse19 (select (select .cse20 c_create_data_~data~0.base) .cse5))) (< (+ .cse17 11 (select (select (store .cse18 .cse19 v_ArrVal_807) c_create_data_~data~0.base) .cse5)) (select |c_#length| (select (select (store .cse20 .cse19 v_ArrVal_806) c_create_data_~data~0.base) .cse5))))) (< .cse7 v_create_data_~counter~0_50) (< (+ (select (select .cse18 c_create_data_~data~0.base) .cse5) .cse17 4) 0))))))))))))))) is different from false [2025-03-17 11:59:23,001 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~counter~0 5)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_794))) (let ((.cse8 (select (select .cse15 c_create_data_~data~0.base) .cse1))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_795))) (let ((.cse9 (select (select .cse14 c_create_data_~data~0.base) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_798))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_799))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse1))) (let ((.cse2 (* v_create_data_~counter~0_50 4)) (.cse6 (store .cse12 .cse11 v_ArrVal_802))) (let ((.cse3 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_793) .cse8 v_ArrVal_796) .cse9 v_ArrVal_797) .cse10 v_ArrVal_800) .cse11 v_ArrVal_801)) (.cse7 (select (select .cse6 c_create_data_~data~0.base) .cse1)) (.cse4 (+ .cse2 |v_create_data_#t~mem8.offset_41|))) (let ((.cse0 (store .cse3 .cse7 (store (select .cse3 .cse7) .cse4 v_ArrVal_803)))) (or (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2 4) 0) (< (select (select .cse3 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< .cse4 0) (< .cse5 v_create_data_~counter~0_50) (< 0 (+ 9 .cse2 (select (select (store .cse0 (select (select (store .cse6 .cse7 v_ArrVal_804) c_create_data_~data~0.base) .cse1) v_ArrVal_807) c_create_data_~data~0.base) .cse1)))))))))))))))) (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_794))) (let ((.cse24 (select (select .cse31 c_create_data_~data~0.base) .cse1))) (let ((.cse30 (store .cse31 .cse24 v_ArrVal_795))) (let ((.cse25 (select (select .cse30 c_create_data_~data~0.base) .cse1))) (let ((.cse29 (store .cse30 .cse25 v_ArrVal_798))) (let ((.cse26 (select (select .cse29 c_create_data_~data~0.base) .cse1))) (let ((.cse28 (store .cse29 .cse26 v_ArrVal_799))) (let ((.cse27 (select (select .cse28 c_create_data_~data~0.base) .cse1))) (let ((.cse17 (* v_create_data_~counter~0_50 4)) (.cse22 (store .cse28 .cse27 v_ArrVal_802))) (let ((.cse18 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_793) .cse24 v_ArrVal_796) .cse25 v_ArrVal_797) .cse26 v_ArrVal_800) .cse27 v_ArrVal_801)) (.cse23 (select (select .cse22 c_create_data_~data~0.base) .cse1)) (.cse19 (+ .cse17 |v_create_data_#t~mem8.offset_41|))) (let ((.cse16 (store .cse18 .cse23 (store (select .cse18 .cse23) .cse19 v_ArrVal_803)))) (or (< (+ (select (select .cse16 c_create_data_~data~0.base) .cse1) .cse17 4) 0) (< (select (select .cse18 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< .cse19 0) (let ((.cse21 (store .cse22 .cse23 v_ArrVal_804))) (let ((.cse20 (select (select .cse21 c_create_data_~data~0.base) .cse1))) (< (+ .cse17 (select (select (store .cse16 .cse20 v_ArrVal_807) c_create_data_~data~0.base) .cse1) 11) (select |c_#length| (select (select (store .cse21 .cse20 v_ArrVal_806) c_create_data_~data~0.base) .cse1))))) (< .cse5 v_create_data_~counter~0_50)))))))))))))))) is different from false [2025-03-17 11:59:23,231 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (+ c_create_data_~counter~0 5)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_794))) (let ((.cse9 (select (select .cse16 c_create_data_~data~0.base) .cse1))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_795))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_798))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_799))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse1))) (let ((.cse2 (* v_create_data_~counter~0_50 4)) (.cse4 (store .cse13 .cse12 v_ArrVal_802))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_793) .cse9 v_ArrVal_796) .cse10 v_ArrVal_797) .cse11 v_ArrVal_800) .cse12 v_ArrVal_801)) (.cse5 (select (select .cse4 c_create_data_~data~0.base) .cse1)) (.cse6 (+ .cse2 |v_create_data_#t~mem8.offset_41|))) (let ((.cse3 (store .cse0 .cse5 (store (select .cse0 .cse5) .cse6 v_ArrVal_803)))) (or (< (select (select .cse0 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< 0 (+ 9 .cse2 (select (select (store .cse3 (select (select (store .cse4 .cse5 v_ArrVal_804) c_create_data_~data~0.base) .cse1) v_ArrVal_807) c_create_data_~data~0.base) .cse1))) (< .cse6 0) (< (+ .cse2 (select (select .cse3 c_create_data_~data~0.base) .cse1) 4) 0) (< .cse7 v_create_data_~counter~0_50)))))))))))))) (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_794))) (let ((.cse25 (select (select .cse32 c_create_data_~data~0.base) .cse1))) (let ((.cse31 (store .cse32 .cse25 v_ArrVal_795))) (let ((.cse26 (select (select .cse31 c_create_data_~data~0.base) .cse1))) (let ((.cse30 (store .cse31 .cse26 v_ArrVal_798))) (let ((.cse27 (select (select .cse30 c_create_data_~data~0.base) .cse1))) (let ((.cse29 (store .cse30 .cse27 v_ArrVal_799))) (let ((.cse28 (select (select .cse29 c_create_data_~data~0.base) .cse1))) (let ((.cse19 (* v_create_data_~counter~0_50 4)) (.cse23 (store .cse29 .cse28 v_ArrVal_802))) (let ((.cse17 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_793) .cse25 v_ArrVal_796) .cse26 v_ArrVal_797) .cse27 v_ArrVal_800) .cse28 v_ArrVal_801)) (.cse24 (select (select .cse23 c_create_data_~data~0.base) .cse1)) (.cse18 (+ .cse19 |v_create_data_#t~mem8.offset_41|))) (let ((.cse20 (store .cse17 .cse24 (store (select .cse17 .cse24) .cse18 v_ArrVal_803)))) (or (< (select (select .cse17 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< .cse18 0) (let ((.cse22 (store .cse23 .cse24 v_ArrVal_804))) (let ((.cse21 (select (select .cse22 c_create_data_~data~0.base) .cse1))) (< (+ .cse19 (select (select (store .cse20 .cse21 v_ArrVal_807) c_create_data_~data~0.base) .cse1) 11) (select |c_#length| (select (select (store .cse22 .cse21 v_ArrVal_806) c_create_data_~data~0.base) .cse1))))) (< (+ .cse19 (select (select .cse20 c_create_data_~data~0.base) .cse1) 4) 0) (< .cse7 v_create_data_~counter~0_50))))))))))))))))) is different from false [2025-03-17 11:59:25,488 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (+ c_create_data_~counter~0 6)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_794))) (let ((.cse9 (select (select .cse16 c_create_data_~data~0.base) .cse1))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_795))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_798))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_799))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse1))) (let ((.cse2 (* v_create_data_~counter~0_50 4)) (.cse4 (store .cse13 .cse12 v_ArrVal_802))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_793) .cse9 v_ArrVal_796) .cse10 v_ArrVal_797) .cse11 v_ArrVal_800) .cse12 v_ArrVal_801)) (.cse5 (select (select .cse4 c_create_data_~data~0.base) .cse1)) (.cse6 (+ .cse2 |v_create_data_#t~mem8.offset_41|))) (let ((.cse3 (store .cse0 .cse5 (store (select .cse0 .cse5) .cse6 v_ArrVal_803)))) (or (< (select (select .cse0 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< 0 (+ 9 .cse2 (select (select (store .cse3 (select (select (store .cse4 .cse5 v_ArrVal_804) c_create_data_~data~0.base) .cse1) v_ArrVal_807) c_create_data_~data~0.base) .cse1))) (< .cse6 0) (< (+ .cse2 (select (select .cse3 c_create_data_~data~0.base) .cse1) 4) 0) (< .cse7 v_create_data_~counter~0_50)))))))))))))) (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_794))) (let ((.cse25 (select (select .cse32 c_create_data_~data~0.base) .cse1))) (let ((.cse31 (store .cse32 .cse25 v_ArrVal_795))) (let ((.cse26 (select (select .cse31 c_create_data_~data~0.base) .cse1))) (let ((.cse30 (store .cse31 .cse26 v_ArrVal_798))) (let ((.cse27 (select (select .cse30 c_create_data_~data~0.base) .cse1))) (let ((.cse29 (store .cse30 .cse27 v_ArrVal_799))) (let ((.cse28 (select (select .cse29 c_create_data_~data~0.base) .cse1))) (let ((.cse19 (* v_create_data_~counter~0_50 4)) (.cse23 (store .cse29 .cse28 v_ArrVal_802))) (let ((.cse17 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_793) .cse25 v_ArrVal_796) .cse26 v_ArrVal_797) .cse27 v_ArrVal_800) .cse28 v_ArrVal_801)) (.cse24 (select (select .cse23 c_create_data_~data~0.base) .cse1)) (.cse18 (+ .cse19 |v_create_data_#t~mem8.offset_41|))) (let ((.cse20 (store .cse17 .cse24 (store (select .cse17 .cse24) .cse18 v_ArrVal_803)))) (or (< (select (select .cse17 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< .cse18 0) (let ((.cse22 (store .cse23 .cse24 v_ArrVal_804))) (let ((.cse21 (select (select .cse22 c_create_data_~data~0.base) .cse1))) (< (+ .cse19 (select (select (store .cse20 .cse21 v_ArrVal_807) c_create_data_~data~0.base) .cse1) 11) (select |c_#length| (select (select (store .cse22 .cse21 v_ArrVal_806) c_create_data_~data~0.base) .cse1))))) (< (+ .cse19 (select (select .cse20 c_create_data_~data~0.base) .cse1) 4) 0) (< .cse7 v_create_data_~counter~0_50))))))))))))))))) is different from false [2025-03-17 11:59:25,624 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_create_data_~counter~0 6)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_791))) (let ((.cse8 (select (select .cse17 c_create_data_~data~0.base) .cse2))) (let ((.cse16 (store .cse17 .cse8 v_ArrVal_794))) (let ((.cse9 (select (select .cse16 c_create_data_~data~0.base) .cse2))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_795))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse2))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_798))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse2))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_799))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse2))) (let ((.cse0 (* v_create_data_~counter~0_50 4)) (.cse5 (store .cse13 .cse12 v_ArrVal_802))) (let ((.cse3 (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_792) .cse8 v_ArrVal_793) .cse9 v_ArrVal_796) .cse10 v_ArrVal_797) .cse11 v_ArrVal_800) .cse12 v_ArrVal_801)) (.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse2)) (.cse4 (+ .cse0 |v_create_data_#t~mem8.offset_41|))) (let ((.cse1 (store .cse3 .cse6 (store (select .cse3 .cse6) .cse4 v_ArrVal_803)))) (or (< (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2) 4) 0) (< (select (select .cse3 c_create_data_~data~0.base) .cse2) |v_create_data_#t~mem8.offset_41|) (< .cse4 0) (< 0 (+ (select (select (store .cse1 (select (select (store .cse5 .cse6 v_ArrVal_804) c_create_data_~data~0.base) .cse2) v_ArrVal_807) c_create_data_~data~0.base) .cse2) 9 .cse0)) (< .cse7 v_create_data_~counter~0_50)))))))))))))))) (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_791))) (let ((.cse26 (select (select .cse35 c_create_data_~data~0.base) .cse2))) (let ((.cse34 (store .cse35 .cse26 v_ArrVal_794))) (let ((.cse27 (select (select .cse34 c_create_data_~data~0.base) .cse2))) (let ((.cse33 (store .cse34 .cse27 v_ArrVal_795))) (let ((.cse28 (select (select .cse33 c_create_data_~data~0.base) .cse2))) (let ((.cse32 (store .cse33 .cse28 v_ArrVal_798))) (let ((.cse29 (select (select .cse32 c_create_data_~data~0.base) .cse2))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_799))) (let ((.cse30 (select (select .cse31 c_create_data_~data~0.base) .cse2))) (let ((.cse20 (* v_create_data_~counter~0_50 4)) (.cse22 (store .cse31 .cse30 v_ArrVal_802))) (let ((.cse24 (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_792) .cse26 v_ArrVal_793) .cse27 v_ArrVal_796) .cse28 v_ArrVal_797) .cse29 v_ArrVal_800) .cse30 v_ArrVal_801)) (.cse23 (select (select .cse22 c_create_data_~data~0.base) .cse2)) (.cse25 (+ .cse20 |v_create_data_#t~mem8.offset_41|))) (let ((.cse18 (store .cse24 .cse23 (store (select .cse24 .cse23) .cse25 v_ArrVal_803)))) (or (let ((.cse21 (store .cse22 .cse23 v_ArrVal_804))) (let ((.cse19 (select (select .cse21 c_create_data_~data~0.base) .cse2))) (< (+ (select (select (store .cse18 .cse19 v_ArrVal_807) c_create_data_~data~0.base) .cse2) .cse20 11) (select |c_#length| (select (select (store .cse21 .cse19 v_ArrVal_806) c_create_data_~data~0.base) .cse2))))) (< (+ .cse20 (select (select .cse18 c_create_data_~data~0.base) .cse2) 4) 0) (< (select (select .cse24 c_create_data_~data~0.base) .cse2) |v_create_data_#t~mem8.offset_41|) (< .cse25 0) (< .cse7 v_create_data_~counter~0_50)))))))))))))))))) is different from false [2025-03-17 11:59:25,854 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse9 (+ c_create_data_~counter~0 6)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#2.base| .cse10 v_ArrVal_791))) (let ((.cse11 (select (select .cse20 c_create_data_~data~0.base) .cse1))) (let ((.cse19 (store .cse20 .cse11 v_ArrVal_794))) (let ((.cse12 (select (select .cse19 c_create_data_~data~0.base) .cse1))) (let ((.cse18 (store .cse19 .cse12 v_ArrVal_795))) (let ((.cse13 (select (select .cse18 c_create_data_~data~0.base) .cse1))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_798))) (let ((.cse14 (select (select .cse17 c_create_data_~data~0.base) .cse1))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_799))) (let ((.cse15 (select (select .cse16 c_create_data_~data~0.base) .cse1))) (let ((.cse3 (* v_create_data_~counter~0_50 4)) (.cse7 (store .cse16 .cse15 v_ArrVal_802))) (let ((.cse0 (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse10 v_ArrVal_792) .cse11 v_ArrVal_793) .cse12 v_ArrVal_796) .cse13 v_ArrVal_797) .cse14 v_ArrVal_800) .cse15 v_ArrVal_801)) (.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse1)) (.cse4 (+ .cse3 |v_create_data_#t~mem8.offset_41|))) (let ((.cse2 (store .cse0 .cse8 (store (select .cse0 .cse8) .cse4 v_ArrVal_803)))) (or (< (select (select .cse0 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< (+ (select (select .cse2 c_create_data_~data~0.base) .cse1) .cse3 4) 0) (< .cse4 0) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_804))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse1))) (< (+ (select (select (store .cse2 .cse5 v_ArrVal_807) c_create_data_~data~0.base) .cse1) .cse3 11) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_806) c_create_data_~data~0.base) .cse1))))) (< .cse9 v_create_data_~counter~0_50)))))))))))))))) (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$#2.base| .cse10 v_ArrVal_791))) (let ((.cse27 (select (select .cse36 c_create_data_~data~0.base) .cse1))) (let ((.cse35 (store .cse36 .cse27 v_ArrVal_794))) (let ((.cse28 (select (select .cse35 c_create_data_~data~0.base) .cse1))) (let ((.cse34 (store .cse35 .cse28 v_ArrVal_795))) (let ((.cse29 (select (select .cse34 c_create_data_~data~0.base) .cse1))) (let ((.cse33 (store .cse34 .cse29 v_ArrVal_798))) (let ((.cse30 (select (select .cse33 c_create_data_~data~0.base) .cse1))) (let ((.cse32 (store .cse33 .cse30 v_ArrVal_799))) (let ((.cse31 (select (select .cse32 c_create_data_~data~0.base) .cse1))) (let ((.cse23 (* v_create_data_~counter~0_50 4)) (.cse25 (store .cse32 .cse31 v_ArrVal_802))) (let ((.cse21 (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse10 v_ArrVal_792) .cse27 v_ArrVal_793) .cse28 v_ArrVal_796) .cse29 v_ArrVal_797) .cse30 v_ArrVal_800) .cse31 v_ArrVal_801)) (.cse26 (select (select .cse25 c_create_data_~data~0.base) .cse1)) (.cse24 (+ .cse23 |v_create_data_#t~mem8.offset_41|))) (let ((.cse22 (store .cse21 .cse26 (store (select .cse21 .cse26) .cse24 v_ArrVal_803)))) (or (< (select (select .cse21 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< (+ (select (select .cse22 c_create_data_~data~0.base) .cse1) .cse23 4) 0) (< .cse24 0) (< 0 (+ (select (select (store .cse22 (select (select (store .cse25 .cse26 v_ArrVal_804) c_create_data_~data~0.base) .cse1) v_ArrVal_807) c_create_data_~data~0.base) .cse1) 9 .cse23)) (< .cse9 v_create_data_~counter~0_50))))))))))))))))))) is different from false [2025-03-17 11:59:45,022 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse5 (+ c_create_data_~counter~0 7)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#2.base| .cse10 v_ArrVal_791))) (let ((.cse11 (select (select .cse20 c_create_data_~data~0.base) .cse1))) (let ((.cse19 (store .cse20 .cse11 v_ArrVal_794))) (let ((.cse12 (select (select .cse19 c_create_data_~data~0.base) .cse1))) (let ((.cse18 (store .cse19 .cse12 v_ArrVal_795))) (let ((.cse13 (select (select .cse18 c_create_data_~data~0.base) .cse1))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_798))) (let ((.cse14 (select (select .cse17 c_create_data_~data~0.base) .cse1))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_799))) (let ((.cse15 (select (select .cse16 c_create_data_~data~0.base) .cse1))) (let ((.cse3 (* v_create_data_~counter~0_50 4)) (.cse8 (store .cse16 .cse15 v_ArrVal_802))) (let ((.cse0 (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse10 v_ArrVal_792) .cse11 v_ArrVal_793) .cse12 v_ArrVal_796) .cse13 v_ArrVal_797) .cse14 v_ArrVal_800) .cse15 v_ArrVal_801)) (.cse9 (select (select .cse8 c_create_data_~data~0.base) .cse1)) (.cse4 (+ .cse3 |v_create_data_#t~mem8.offset_41|))) (let ((.cse2 (store .cse0 .cse9 (store (select .cse0 .cse9) .cse4 v_ArrVal_803)))) (or (< (select (select .cse0 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< (+ (select (select .cse2 c_create_data_~data~0.base) .cse1) .cse3 4) 0) (< .cse4 0) (< .cse5 v_create_data_~counter~0_50) (let ((.cse7 (store .cse8 .cse9 v_ArrVal_804))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse1))) (< (+ (select (select (store .cse2 .cse6 v_ArrVal_807) c_create_data_~data~0.base) .cse1) .cse3 11) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_806) c_create_data_~data~0.base) .cse1)))))))))))))))))))) (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$#2.base| .cse10 v_ArrVal_791))) (let ((.cse27 (select (select .cse36 c_create_data_~data~0.base) .cse1))) (let ((.cse35 (store .cse36 .cse27 v_ArrVal_794))) (let ((.cse28 (select (select .cse35 c_create_data_~data~0.base) .cse1))) (let ((.cse34 (store .cse35 .cse28 v_ArrVal_795))) (let ((.cse29 (select (select .cse34 c_create_data_~data~0.base) .cse1))) (let ((.cse33 (store .cse34 .cse29 v_ArrVal_798))) (let ((.cse30 (select (select .cse33 c_create_data_~data~0.base) .cse1))) (let ((.cse32 (store .cse33 .cse30 v_ArrVal_799))) (let ((.cse31 (select (select .cse32 c_create_data_~data~0.base) .cse1))) (let ((.cse23 (* v_create_data_~counter~0_50 4)) (.cse25 (store .cse32 .cse31 v_ArrVal_802))) (let ((.cse21 (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse10 v_ArrVal_792) .cse27 v_ArrVal_793) .cse28 v_ArrVal_796) .cse29 v_ArrVal_797) .cse30 v_ArrVal_800) .cse31 v_ArrVal_801)) (.cse26 (select (select .cse25 c_create_data_~data~0.base) .cse1)) (.cse24 (+ .cse23 |v_create_data_#t~mem8.offset_41|))) (let ((.cse22 (store .cse21 .cse26 (store (select .cse21 .cse26) .cse24 v_ArrVal_803)))) (or (< (select (select .cse21 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< (+ (select (select .cse22 c_create_data_~data~0.base) .cse1) .cse23 4) 0) (< .cse24 0) (< .cse5 v_create_data_~counter~0_50) (< 0 (+ (select (select (store .cse22 (select (select (store .cse25 .cse26 v_ArrVal_804) c_create_data_~data~0.base) .cse1) v_ArrVal_807) c_create_data_~data~0.base) .cse1) 9 .cse23)))))))))))))))))))) is different from false [2025-03-17 11:59:45,165 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~counter~0 7)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_790))) (let ((.cse10 (select (select .cse21 c_create_data_~data~0.base) .cse1))) (let ((.cse20 (store .cse21 .cse10 v_ArrVal_791))) (let ((.cse11 (select (select .cse20 c_create_data_~data~0.base) .cse1))) (let ((.cse19 (store .cse20 .cse11 v_ArrVal_794))) (let ((.cse12 (select (select .cse19 c_create_data_~data~0.base) .cse1))) (let ((.cse18 (store .cse19 .cse12 v_ArrVal_795))) (let ((.cse13 (select (select .cse18 c_create_data_~data~0.base) .cse1))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_798))) (let ((.cse14 (select (select .cse17 c_create_data_~data~0.base) .cse1))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_799))) (let ((.cse15 (select (select .cse16 c_create_data_~data~0.base) .cse1))) (let ((.cse2 (* v_create_data_~counter~0_50 4)) (.cse8 (store .cse16 .cse15 v_ArrVal_802))) (let ((.cse0 (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_789) .cse10 v_ArrVal_792) .cse11 v_ArrVal_793) .cse12 v_ArrVal_796) .cse13 v_ArrVal_797) .cse14 v_ArrVal_800) .cse15 v_ArrVal_801)) (.cse9 (select (select .cse8 c_create_data_~data~0.base) .cse1)) (.cse4 (+ .cse2 |v_create_data_#t~mem8.offset_41|))) (let ((.cse3 (store .cse0 .cse9 (store (select .cse0 .cse9) .cse4 v_ArrVal_803)))) (or (< (select (select .cse0 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< (+ .cse2 4 (select (select .cse3 c_create_data_~data~0.base) .cse1)) 0) (< .cse4 0) (< .cse5 v_create_data_~counter~0_50) (let ((.cse7 (store .cse8 .cse9 v_ArrVal_804))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse1))) (< (+ (select (select (store .cse3 .cse6 v_ArrVal_807) c_create_data_~data~0.base) .cse1) .cse2 11) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_806) c_create_data_~data~0.base) .cse1)))))))))))))))))))))) (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (let ((.cse39 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_790))) (let ((.cse28 (select (select .cse39 c_create_data_~data~0.base) .cse1))) (let ((.cse38 (store .cse39 .cse28 v_ArrVal_791))) (let ((.cse29 (select (select .cse38 c_create_data_~data~0.base) .cse1))) (let ((.cse37 (store .cse38 .cse29 v_ArrVal_794))) (let ((.cse30 (select (select .cse37 c_create_data_~data~0.base) .cse1))) (let ((.cse36 (store .cse37 .cse30 v_ArrVal_795))) (let ((.cse31 (select (select .cse36 c_create_data_~data~0.base) .cse1))) (let ((.cse35 (store .cse36 .cse31 v_ArrVal_798))) (let ((.cse32 (select (select .cse35 c_create_data_~data~0.base) .cse1))) (let ((.cse34 (store .cse35 .cse32 v_ArrVal_799))) (let ((.cse33 (select (select .cse34 c_create_data_~data~0.base) .cse1))) (let ((.cse23 (* v_create_data_~counter~0_50 4)) (.cse26 (store .cse34 .cse33 v_ArrVal_802))) (let ((.cse22 (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_789) .cse28 v_ArrVal_792) .cse29 v_ArrVal_793) .cse30 v_ArrVal_796) .cse31 v_ArrVal_797) .cse32 v_ArrVal_800) .cse33 v_ArrVal_801)) (.cse27 (select (select .cse26 c_create_data_~data~0.base) .cse1)) (.cse25 (+ .cse23 |v_create_data_#t~mem8.offset_41|))) (let ((.cse24 (store .cse22 .cse27 (store (select .cse22 .cse27) .cse25 v_ArrVal_803)))) (or (< (select (select .cse22 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< (+ .cse23 4 (select (select .cse24 c_create_data_~data~0.base) .cse1)) 0) (< .cse25 0) (< .cse5 v_create_data_~counter~0_50) (< 0 (+ 9 (select (select (store .cse24 (select (select (store .cse26 .cse27 v_ArrVal_804) c_create_data_~data~0.base) .cse1) v_ArrVal_807) c_create_data_~data~0.base) .cse1) .cse23))))))))))))))))))))) is different from false [2025-03-17 11:59:45,445 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (+ c_create_data_~counter~0 7)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_790))) (let ((.cse9 (select (select .cse20 c_create_data_~data~0.base) .cse1))) (let ((.cse19 (store .cse20 .cse9 v_ArrVal_791))) (let ((.cse10 (select (select .cse19 c_create_data_~data~0.base) .cse1))) (let ((.cse18 (store .cse19 .cse10 v_ArrVal_794))) (let ((.cse11 (select (select .cse18 c_create_data_~data~0.base) .cse1))) (let ((.cse17 (store .cse18 .cse11 v_ArrVal_795))) (let ((.cse12 (select (select .cse17 c_create_data_~data~0.base) .cse1))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_798))) (let ((.cse13 (select (select .cse16 c_create_data_~data~0.base) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_799))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse1))) (let ((.cse2 (* v_create_data_~counter~0_50 4)) (.cse4 (store .cse15 .cse14 v_ArrVal_802))) (let ((.cse0 (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_789) .cse9 v_ArrVal_792) .cse10 v_ArrVal_793) .cse11 v_ArrVal_796) .cse12 v_ArrVal_797) .cse13 v_ArrVal_800) .cse14 v_ArrVal_801)) (.cse5 (select (select .cse4 c_create_data_~data~0.base) .cse1)) (.cse6 (+ .cse2 |v_create_data_#t~mem8.offset_41|))) (let ((.cse3 (store .cse0 .cse5 (store (select .cse0 .cse5) .cse6 v_ArrVal_803)))) (or (< (select (select .cse0 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< 0 (+ 9 .cse2 (select (select (store .cse3 (select (select (store .cse4 .cse5 v_ArrVal_804) c_create_data_~data~0.base) .cse1) v_ArrVal_807) c_create_data_~data~0.base) .cse1))) (< .cse6 0) (< .cse7 v_create_data_~counter~0_50) (< (+ .cse2 (select (select .cse3 c_create_data_~data~0.base) .cse1) 4) 0)))))))))))))))))) (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse40 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_790))) (let ((.cse29 (select (select .cse40 c_create_data_~data~0.base) .cse1))) (let ((.cse39 (store .cse40 .cse29 v_ArrVal_791))) (let ((.cse30 (select (select .cse39 c_create_data_~data~0.base) .cse1))) (let ((.cse38 (store .cse39 .cse30 v_ArrVal_794))) (let ((.cse31 (select (select .cse38 c_create_data_~data~0.base) .cse1))) (let ((.cse37 (store .cse38 .cse31 v_ArrVal_795))) (let ((.cse32 (select (select .cse37 c_create_data_~data~0.base) .cse1))) (let ((.cse36 (store .cse37 .cse32 v_ArrVal_798))) (let ((.cse33 (select (select .cse36 c_create_data_~data~0.base) .cse1))) (let ((.cse35 (store .cse36 .cse33 v_ArrVal_799))) (let ((.cse34 (select (select .cse35 c_create_data_~data~0.base) .cse1))) (let ((.cse21 (* v_create_data_~counter~0_50 4)) (.cse25 (store .cse35 .cse34 v_ArrVal_802))) (let ((.cse27 (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_789) .cse29 v_ArrVal_792) .cse30 v_ArrVal_793) .cse31 v_ArrVal_796) .cse32 v_ArrVal_797) .cse33 v_ArrVal_800) .cse34 v_ArrVal_801)) (.cse26 (select (select .cse25 c_create_data_~data~0.base) .cse1)) (.cse28 (+ .cse21 |v_create_data_#t~mem8.offset_41|))) (let ((.cse22 (store .cse27 .cse26 (store (select .cse27 .cse26) .cse28 v_ArrVal_803)))) (or (let ((.cse24 (store .cse25 .cse26 v_ArrVal_804))) (let ((.cse23 (select (select .cse24 c_create_data_~data~0.base) .cse1))) (< (+ .cse21 (select (select (store .cse22 .cse23 v_ArrVal_807) c_create_data_~data~0.base) .cse1) 11) (select |c_#length| (select (select (store .cse24 .cse23 v_ArrVal_806) c_create_data_~data~0.base) .cse1))))) (< (select (select .cse27 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< .cse28 0) (< .cse7 v_create_data_~counter~0_50) (< (+ .cse21 (select (select .cse22 c_create_data_~data~0.base) .cse1) 4) 0))))))))))))))))))))) is different from false [2025-03-17 11:59:45,724 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (+ c_create_data_~counter~0 8)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_790))) (let ((.cse9 (select (select .cse20 c_create_data_~data~0.base) .cse1))) (let ((.cse19 (store .cse20 .cse9 v_ArrVal_791))) (let ((.cse10 (select (select .cse19 c_create_data_~data~0.base) .cse1))) (let ((.cse18 (store .cse19 .cse10 v_ArrVal_794))) (let ((.cse11 (select (select .cse18 c_create_data_~data~0.base) .cse1))) (let ((.cse17 (store .cse18 .cse11 v_ArrVal_795))) (let ((.cse12 (select (select .cse17 c_create_data_~data~0.base) .cse1))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_798))) (let ((.cse13 (select (select .cse16 c_create_data_~data~0.base) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_799))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse1))) (let ((.cse3 (* v_create_data_~counter~0_50 4)) (.cse5 (store .cse15 .cse14 v_ArrVal_802))) (let ((.cse0 (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_789) .cse9 v_ArrVal_792) .cse10 v_ArrVal_793) .cse11 v_ArrVal_796) .cse12 v_ArrVal_797) .cse13 v_ArrVal_800) .cse14 v_ArrVal_801)) (.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse1)) (.cse7 (+ .cse3 |v_create_data_#t~mem8.offset_41|))) (let ((.cse4 (store .cse0 .cse6 (store (select .cse0 .cse6) .cse7 v_ArrVal_803)))) (or (< (select (select .cse0 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< .cse2 v_create_data_~counter~0_50) (< 0 (+ 9 .cse3 (select (select (store .cse4 (select (select (store .cse5 .cse6 v_ArrVal_804) c_create_data_~data~0.base) .cse1) v_ArrVal_807) c_create_data_~data~0.base) .cse1))) (< .cse7 0) (< (+ .cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1) 4) 0)))))))))))))))))) (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse40 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_790))) (let ((.cse29 (select (select .cse40 c_create_data_~data~0.base) .cse1))) (let ((.cse39 (store .cse40 .cse29 v_ArrVal_791))) (let ((.cse30 (select (select .cse39 c_create_data_~data~0.base) .cse1))) (let ((.cse38 (store .cse39 .cse30 v_ArrVal_794))) (let ((.cse31 (select (select .cse38 c_create_data_~data~0.base) .cse1))) (let ((.cse37 (store .cse38 .cse31 v_ArrVal_795))) (let ((.cse32 (select (select .cse37 c_create_data_~data~0.base) .cse1))) (let ((.cse36 (store .cse37 .cse32 v_ArrVal_798))) (let ((.cse33 (select (select .cse36 c_create_data_~data~0.base) .cse1))) (let ((.cse35 (store .cse36 .cse33 v_ArrVal_799))) (let ((.cse34 (select (select .cse35 c_create_data_~data~0.base) .cse1))) (let ((.cse21 (* v_create_data_~counter~0_50 4)) (.cse25 (store .cse35 .cse34 v_ArrVal_802))) (let ((.cse27 (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_789) .cse29 v_ArrVal_792) .cse30 v_ArrVal_793) .cse31 v_ArrVal_796) .cse32 v_ArrVal_797) .cse33 v_ArrVal_800) .cse34 v_ArrVal_801)) (.cse26 (select (select .cse25 c_create_data_~data~0.base) .cse1)) (.cse28 (+ .cse21 |v_create_data_#t~mem8.offset_41|))) (let ((.cse22 (store .cse27 .cse26 (store (select .cse27 .cse26) .cse28 v_ArrVal_803)))) (or (let ((.cse24 (store .cse25 .cse26 v_ArrVal_804))) (let ((.cse23 (select (select .cse24 c_create_data_~data~0.base) .cse1))) (< (+ .cse21 (select (select (store .cse22 .cse23 v_ArrVal_807) c_create_data_~data~0.base) .cse1) 11) (select |c_#length| (select (select (store .cse24 .cse23 v_ArrVal_806) c_create_data_~data~0.base) .cse1))))) (< (select (select .cse27 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< .cse2 v_create_data_~counter~0_50) (< .cse28 0) (< (+ .cse21 (select (select .cse22 c_create_data_~data~0.base) .cse1) 4) 0))))))))))))))))))))) is different from false [2025-03-17 11:59:46,050 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse22 (select |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base|)) (.cse23 (+ |c_create_data_#t~mem8.offset| (* c_create_data_~counter~0 4))) (.cse6 (+ c_create_data_~counter~0 8)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_787 (Array Int Int))) (or (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_788 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_787))) (let ((.cse8 (select (select .cse21 c_create_data_~data~0.base) .cse1))) (let ((.cse20 (store .cse21 .cse8 v_ArrVal_790))) (let ((.cse9 (select (select .cse20 c_create_data_~data~0.base) .cse1))) (let ((.cse19 (store .cse20 .cse9 v_ArrVal_791))) (let ((.cse10 (select (select .cse19 c_create_data_~data~0.base) .cse1))) (let ((.cse18 (store .cse19 .cse10 v_ArrVal_794))) (let ((.cse11 (select (select .cse18 c_create_data_~data~0.base) .cse1))) (let ((.cse17 (store .cse18 .cse11 v_ArrVal_795))) (let ((.cse12 (select (select .cse17 c_create_data_~data~0.base) .cse1))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_798))) (let ((.cse13 (select (select .cse16 c_create_data_~data~0.base) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_799))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse1))) (let ((.cse5 (* v_create_data_~counter~0_50 4)) (.cse3 (store .cse15 .cse14 v_ArrVal_802))) (let ((.cse0 (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_788) .cse8 v_ArrVal_789) .cse9 v_ArrVal_792) .cse10 v_ArrVal_793) .cse11 v_ArrVal_796) .cse12 v_ArrVal_797) .cse13 v_ArrVal_800) .cse14 v_ArrVal_801)) (.cse4 (select (select .cse3 c_create_data_~data~0.base) .cse1)) (.cse7 (+ .cse5 |v_create_data_#t~mem8.offset_41|))) (let ((.cse2 (store .cse0 .cse4 (store (select .cse0 .cse4) .cse7 v_ArrVal_803)))) (or (< (select (select .cse0 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (< 0 (+ (select (select (store .cse2 (select (select (store .cse3 .cse4 v_ArrVal_804) c_create_data_~data~0.base) .cse1) v_ArrVal_807) c_create_data_~data~0.base) .cse1) 9 .cse5)) (< .cse6 v_create_data_~counter~0_50) (< .cse7 0) (< (+ (select (select .cse2 c_create_data_~data~0.base) .cse1) .cse5 4) 0)))))))))))))))))))) (not (= v_ArrVal_787 (store .cse22 .cse23 (select v_ArrVal_787 .cse23)))))) (forall ((v_ArrVal_787 (Array Int Int))) (or (not (= v_ArrVal_787 (store .cse22 .cse23 (select v_ArrVal_787 .cse23)))) (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_788 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse45 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_787))) (let ((.cse32 (select (select .cse45 c_create_data_~data~0.base) .cse1))) (let ((.cse44 (store .cse45 .cse32 v_ArrVal_790))) (let ((.cse33 (select (select .cse44 c_create_data_~data~0.base) .cse1))) (let ((.cse43 (store .cse44 .cse33 v_ArrVal_791))) (let ((.cse34 (select (select .cse43 c_create_data_~data~0.base) .cse1))) (let ((.cse42 (store .cse43 .cse34 v_ArrVal_794))) (let ((.cse35 (select (select .cse42 c_create_data_~data~0.base) .cse1))) (let ((.cse41 (store .cse42 .cse35 v_ArrVal_795))) (let ((.cse36 (select (select .cse41 c_create_data_~data~0.base) .cse1))) (let ((.cse40 (store .cse41 .cse36 v_ArrVal_798))) (let ((.cse37 (select (select .cse40 c_create_data_~data~0.base) .cse1))) (let ((.cse39 (store .cse40 .cse37 v_ArrVal_799))) (let ((.cse38 (select (select .cse39 c_create_data_~data~0.base) .cse1))) (let ((.cse27 (* v_create_data_~counter~0_50 4)) (.cse29 (store .cse39 .cse38 v_ArrVal_802))) (let ((.cse24 (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_788) .cse32 v_ArrVal_789) .cse33 v_ArrVal_792) .cse34 v_ArrVal_793) .cse35 v_ArrVal_796) .cse36 v_ArrVal_797) .cse37 v_ArrVal_800) .cse38 v_ArrVal_801)) (.cse30 (select (select .cse29 c_create_data_~data~0.base) .cse1)) (.cse31 (+ .cse27 |v_create_data_#t~mem8.offset_41|))) (let ((.cse25 (store .cse24 .cse30 (store (select .cse24 .cse30) .cse31 v_ArrVal_803)))) (or (< (select (select .cse24 c_create_data_~data~0.base) .cse1) |v_create_data_#t~mem8.offset_41|) (let ((.cse28 (store .cse29 .cse30 v_ArrVal_804))) (let ((.cse26 (select (select .cse28 c_create_data_~data~0.base) .cse1))) (< (+ (select (select (store .cse25 .cse26 v_ArrVal_807) c_create_data_~data~0.base) .cse1) .cse27 11) (select |c_#length| (select (select (store .cse28 .cse26 v_ArrVal_806) c_create_data_~data~0.base) .cse1))))) (< .cse6 v_create_data_~counter~0_50) (< .cse31 0) (< (+ (select (select .cse25 c_create_data_~data~0.base) .cse1) .cse27 4) 0)))))))))))))))))))))))) is different from false [2025-03-17 11:59:46,516 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse3)) (.cse26 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse28 (* c_create_data_~counter~0 4)) (.cse9 (+ c_create_data_~counter~0 8))) (and (forall ((|v_create_data_#t~mem8.offset_57| Int)) (or (< .cse0 |v_create_data_#t~mem8.offset_57|) (forall ((v_ArrVal_787 (Array Int Int))) (or (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_788 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$#2.base| .cse11 v_ArrVal_787))) (let ((.cse12 (select (select .cse25 c_create_data_~data~0.base) .cse3))) (let ((.cse24 (store .cse25 .cse12 v_ArrVal_790))) (let ((.cse13 (select (select .cse24 c_create_data_~data~0.base) .cse3))) (let ((.cse23 (store .cse24 .cse13 v_ArrVal_791))) (let ((.cse14 (select (select .cse23 c_create_data_~data~0.base) .cse3))) (let ((.cse22 (store .cse23 .cse14 v_ArrVal_794))) (let ((.cse15 (select (select .cse22 c_create_data_~data~0.base) .cse3))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_795))) (let ((.cse16 (select (select .cse21 c_create_data_~data~0.base) .cse3))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_798))) (let ((.cse17 (select (select .cse20 c_create_data_~data~0.base) .cse3))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_799))) (let ((.cse18 (select (select .cse19 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (* v_create_data_~counter~0_50 4)) (.cse6 (store .cse19 .cse18 v_ArrVal_802))) (let ((.cse8 (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse11 v_ArrVal_788) .cse12 v_ArrVal_789) .cse13 v_ArrVal_792) .cse14 v_ArrVal_793) .cse15 v_ArrVal_796) .cse16 v_ArrVal_797) .cse17 v_ArrVal_800) .cse18 v_ArrVal_801)) (.cse7 (select (select .cse6 c_create_data_~data~0.base) .cse3)) (.cse10 (+ .cse4 |v_create_data_#t~mem8.offset_41|))) (let ((.cse1 (store .cse8 .cse7 (store (select .cse8 .cse7) .cse10 v_ArrVal_803)))) (or (let ((.cse5 (store .cse6 .cse7 v_ArrVal_804))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (< (+ (select (select (store .cse1 .cse2 v_ArrVal_807) c_create_data_~data~0.base) .cse3) .cse4 11) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_806) c_create_data_~data~0.base) .cse3))))) (< (select (select .cse8 c_create_data_~data~0.base) .cse3) |v_create_data_#t~mem8.offset_41|) (< .cse9 v_create_data_~counter~0_50) (< .cse10 0) (< (+ .cse4 (select (select .cse1 c_create_data_~data~0.base) .cse3) 4) 0)))))))))))))))))))) (not (= v_ArrVal_787 (let ((.cse27 (+ .cse28 |v_create_data_#t~mem8.offset_57|))) (store .cse26 .cse27 (select v_ArrVal_787 .cse27))))))))) (forall ((|v_create_data_#t~mem8.offset_57| Int)) (or (< .cse0 |v_create_data_#t~mem8.offset_57|) (forall ((v_ArrVal_787 (Array Int Int))) (or (not (= v_ArrVal_787 (let ((.cse29 (+ .cse28 |v_create_data_#t~mem8.offset_57|))) (store .cse26 .cse29 (select v_ArrVal_787 .cse29))))) (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_788 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$#2.base| .cse11 v_ArrVal_787))) (let ((.cse36 (select (select .cse49 c_create_data_~data~0.base) .cse3))) (let ((.cse48 (store .cse49 .cse36 v_ArrVal_790))) (let ((.cse37 (select (select .cse48 c_create_data_~data~0.base) .cse3))) (let ((.cse47 (store .cse48 .cse37 v_ArrVal_791))) (let ((.cse38 (select (select .cse47 c_create_data_~data~0.base) .cse3))) (let ((.cse46 (store .cse47 .cse38 v_ArrVal_794))) (let ((.cse39 (select (select .cse46 c_create_data_~data~0.base) .cse3))) (let ((.cse45 (store .cse46 .cse39 v_ArrVal_795))) (let ((.cse40 (select (select .cse45 c_create_data_~data~0.base) .cse3))) (let ((.cse44 (store .cse45 .cse40 v_ArrVal_798))) (let ((.cse41 (select (select .cse44 c_create_data_~data~0.base) .cse3))) (let ((.cse43 (store .cse44 .cse41 v_ArrVal_799))) (let ((.cse42 (select (select .cse43 c_create_data_~data~0.base) .cse3))) (let ((.cse33 (* v_create_data_~counter~0_50 4)) (.cse31 (store .cse43 .cse42 v_ArrVal_802))) (let ((.cse34 (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse11 v_ArrVal_788) .cse36 v_ArrVal_789) .cse37 v_ArrVal_792) .cse38 v_ArrVal_793) .cse39 v_ArrVal_796) .cse40 v_ArrVal_797) .cse41 v_ArrVal_800) .cse42 v_ArrVal_801)) (.cse32 (select (select .cse31 c_create_data_~data~0.base) .cse3)) (.cse35 (+ .cse33 |v_create_data_#t~mem8.offset_41|))) (let ((.cse30 (store .cse34 .cse32 (store (select .cse34 .cse32) .cse35 v_ArrVal_803)))) (or (< 0 (+ (select (select (store .cse30 (select (select (store .cse31 .cse32 v_ArrVal_804) c_create_data_~data~0.base) .cse3) v_ArrVal_807) c_create_data_~data~0.base) .cse3) 9 .cse33)) (< (select (select .cse34 c_create_data_~data~0.base) .cse3) |v_create_data_#t~mem8.offset_41|) (< .cse9 v_create_data_~counter~0_50) (< .cse35 0) (< (+ .cse33 (select (select .cse30 c_create_data_~data~0.base) .cse3) 4) 0)))))))))))))))))))))))))))) is different from false [2025-03-17 11:59:47,001 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse3)) (.cse25 (select |c_#memory_$Pointer$#2.base| .cse10))) (and (forall ((v_create_data_~counter~0_58 Int)) (or (forall ((|v_create_data_#t~mem8.offset_57| Int)) (or (< .cse0 |v_create_data_#t~mem8.offset_57|) (forall ((v_ArrVal_787 (Array Int Int))) (or (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_788 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#2.base| .cse10 v_ArrVal_787))) (let ((.cse11 (select (select .cse24 c_create_data_~data~0.base) .cse3))) (let ((.cse23 (store .cse24 .cse11 v_ArrVal_790))) (let ((.cse12 (select (select .cse23 c_create_data_~data~0.base) .cse3))) (let ((.cse22 (store .cse23 .cse12 v_ArrVal_791))) (let ((.cse13 (select (select .cse22 c_create_data_~data~0.base) .cse3))) (let ((.cse21 (store .cse22 .cse13 v_ArrVal_794))) (let ((.cse14 (select (select .cse21 c_create_data_~data~0.base) .cse3))) (let ((.cse20 (store .cse21 .cse14 v_ArrVal_795))) (let ((.cse15 (select (select .cse20 c_create_data_~data~0.base) .cse3))) (let ((.cse19 (store .cse20 .cse15 v_ArrVal_798))) (let ((.cse16 (select (select .cse19 c_create_data_~data~0.base) .cse3))) (let ((.cse18 (store .cse19 .cse16 v_ArrVal_799))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (* v_create_data_~counter~0_50 4)) (.cse6 (store .cse18 .cse17 v_ArrVal_802))) (let ((.cse8 (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse10 v_ArrVal_788) .cse11 v_ArrVal_789) .cse12 v_ArrVal_792) .cse13 v_ArrVal_793) .cse14 v_ArrVal_796) .cse15 v_ArrVal_797) .cse16 v_ArrVal_800) .cse17 v_ArrVal_801)) (.cse7 (select (select .cse6 c_create_data_~data~0.base) .cse3)) (.cse9 (+ .cse4 |v_create_data_#t~mem8.offset_41|))) (let ((.cse1 (store .cse8 .cse7 (store (select .cse8 .cse7) .cse9 v_ArrVal_803)))) (or (< (+ v_create_data_~counter~0_58 8) v_create_data_~counter~0_50) (let ((.cse5 (store .cse6 .cse7 v_ArrVal_804))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (< (+ (select (select (store .cse1 .cse2 v_ArrVal_807) c_create_data_~data~0.base) .cse3) .cse4 11) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_806) c_create_data_~data~0.base) .cse3))))) (< (select (select .cse8 c_create_data_~data~0.base) .cse3) |v_create_data_#t~mem8.offset_41|) (< .cse9 0) (< (+ .cse4 (select (select .cse1 c_create_data_~data~0.base) .cse3) 4) 0)))))))))))))))))))) (not (= v_ArrVal_787 (let ((.cse26 (+ (* v_create_data_~counter~0_58 4) |v_create_data_#t~mem8.offset_57|))) (store .cse25 .cse26 (select v_ArrVal_787 .cse26))))))))) (< 0 v_create_data_~counter~0_58))) (forall ((v_create_data_~counter~0_58 Int)) (or (< 0 v_create_data_~counter~0_58) (forall ((|v_create_data_#t~mem8.offset_57| Int)) (or (< .cse0 |v_create_data_#t~mem8.offset_57|) (forall ((v_ArrVal_787 (Array Int Int))) (or (forall ((|v_create_data_#t~mem8.offset_41| Int) (v_create_data_~counter~0_50 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_803 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_788 (Array Int Int)) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_798 (Array Int Int)) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (let ((.cse46 (store |c_#memory_$Pointer$#2.base| .cse10 v_ArrVal_787))) (let ((.cse33 (select (select .cse46 c_create_data_~data~0.base) .cse3))) (let ((.cse45 (store .cse46 .cse33 v_ArrVal_790))) (let ((.cse34 (select (select .cse45 c_create_data_~data~0.base) .cse3))) (let ((.cse44 (store .cse45 .cse34 v_ArrVal_791))) (let ((.cse35 (select (select .cse44 c_create_data_~data~0.base) .cse3))) (let ((.cse43 (store .cse44 .cse35 v_ArrVal_794))) (let ((.cse36 (select (select .cse43 c_create_data_~data~0.base) .cse3))) (let ((.cse42 (store .cse43 .cse36 v_ArrVal_795))) (let ((.cse37 (select (select .cse42 c_create_data_~data~0.base) .cse3))) (let ((.cse41 (store .cse42 .cse37 v_ArrVal_798))) (let ((.cse38 (select (select .cse41 c_create_data_~data~0.base) .cse3))) (let ((.cse40 (store .cse41 .cse38 v_ArrVal_799))) (let ((.cse39 (select (select .cse40 c_create_data_~data~0.base) .cse3))) (let ((.cse30 (* v_create_data_~counter~0_50 4)) (.cse28 (store .cse40 .cse39 v_ArrVal_802))) (let ((.cse31 (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse10 v_ArrVal_788) .cse33 v_ArrVal_789) .cse34 v_ArrVal_792) .cse35 v_ArrVal_793) .cse36 v_ArrVal_796) .cse37 v_ArrVal_797) .cse38 v_ArrVal_800) .cse39 v_ArrVal_801)) (.cse29 (select (select .cse28 c_create_data_~data~0.base) .cse3)) (.cse32 (+ .cse30 |v_create_data_#t~mem8.offset_41|))) (let ((.cse27 (store .cse31 .cse29 (store (select .cse31 .cse29) .cse32 v_ArrVal_803)))) (or (< (+ v_create_data_~counter~0_58 8) v_create_data_~counter~0_50) (< 0 (+ (select (select (store .cse27 (select (select (store .cse28 .cse29 v_ArrVal_804) c_create_data_~data~0.base) .cse3) v_ArrVal_807) c_create_data_~data~0.base) .cse3) 9 .cse30)) (< (select (select .cse31 c_create_data_~data~0.base) .cse3) |v_create_data_#t~mem8.offset_41|) (< .cse32 0) (< (+ .cse30 (select (select .cse27 c_create_data_~data~0.base) .cse3) 4) 0)))))))))))))))))))) (not (= v_ArrVal_787 (let ((.cse47 (+ (* v_create_data_~counter~0_58 4) |v_create_data_#t~mem8.offset_57|))) (store .cse25 .cse47 (select v_ArrVal_787 .cse47))))))))))))))) is different from false [2025-03-17 11:59:47,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:59:47,092 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 42244 treesize of output 42204 [2025-03-17 11:59:47,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:59:47,112 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 42223 treesize of output 23073