./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-48c9605-m [2025-02-08 06:25:25,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:25:26,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:25:26,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:25:26,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:25:26,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:25:26,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:25:26,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:25:26,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:25:26,085 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:25:26,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:25:26,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:25:26,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:25:26,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:25:26,087 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:25:26,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:25:26,087 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:25:26,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:25:26,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:25:26,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:25:26,087 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:25:26,088 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:25:26,088 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:25:26,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:25:26,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:25:26,089 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:25:26,089 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:25:26,089 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:25:26,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:25:26,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:25:26,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:25:26,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:25:26,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:25:26,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:25:26,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:25:26,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:25:26,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:25:26,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:25:26,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:25:26,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:25:26,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:25:26,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:25:26,091 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-jdk21/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-02-08 06:25:26,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:25:26,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:25:26,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:25:26,383 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:25:26,383 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:25:26,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2025-02-08 06:25:27,830 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed5daf8ad/451347c97a2e4a63b10f3f0a419faf58/FLAG2d45f3c28 [2025-02-08 06:25:28,228 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:25:28,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2025-02-08 06:25:28,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed5daf8ad/451347c97a2e4a63b10f3f0a419faf58/FLAG2d45f3c28 [2025-02-08 06:25:28,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed5daf8ad/451347c97a2e4a63b10f3f0a419faf58 [2025-02-08 06:25:28,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:25:28,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:25:28,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:25:28,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:25:28,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:25:28,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:25:28" (1/1) ... [2025-02-08 06:25:28,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ef7baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:28, skipping insertion in model container [2025-02-08 06:25:28,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:25:28" (1/1) ... [2025-02-08 06:25:28,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:25:28,668 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:25:28,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:25:28,704 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:25:28,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:25:28,774 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:25:28,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:28 WrapperNode [2025-02-08 06:25:28,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:25:28,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:25:28,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:25:28,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:25:28,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:28" (1/1) ... [2025-02-08 06:25:28,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:28" (1/1) ... [2025-02-08 06:25:28,822 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2025-02-08 06:25:28,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:25:28,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:25:28,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:25:28,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:25:28,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:28" (1/1) ... [2025-02-08 06:25:28,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:28" (1/1) ... [2025-02-08 06:25:28,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:28" (1/1) ... [2025-02-08 06:25:28,878 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-02-08 06:25:28,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:28" (1/1) ... [2025-02-08 06:25:28,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:28" (1/1) ... [2025-02-08 06:25:28,889 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:28" (1/1) ... [2025-02-08 06:25:28,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:28" (1/1) ... [2025-02-08 06:25:28,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:28" (1/1) ... [2025-02-08 06:25:28,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:28" (1/1) ... [2025-02-08 06:25:28,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:25:28,897 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:25:28,898 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:25:28,898 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:25:28,899 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:28" (1/1) ... [2025-02-08 06:25:28,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:25:28,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:28,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:25:28,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:25:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:25:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:25:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:25:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:25:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:25:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:25:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:25:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2025-02-08 06:25:28,975 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2025-02-08 06:25:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:25:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:25:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:25:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:25:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:25:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:25:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:25:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:25:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:25:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:25:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:25:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:25:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:25:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:25:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:25:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:25:28,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:25:29,128 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:25:29,130 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:25:29,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc #t~mem5.base, #t~mem5.offset; [2025-02-08 06:25:29,799 INFO L1324 $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-02-08 06:25:29,837 INFO L? ?]: Removed 202 outVars from TransFormulas that were not future-live. [2025-02-08 06:25:29,837 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:25:29,860 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:25:29,861 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:25:29,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:25:29 BoogieIcfgContainer [2025-02-08 06:25:29,861 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:25:29,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:25:29,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:25:29,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:25:29,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:25:28" (1/3) ... [2025-02-08 06:25:29,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556ef777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:25:29, skipping insertion in model container [2025-02-08 06:25:29,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:28" (2/3) ... [2025-02-08 06:25:29,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556ef777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:25:29, skipping insertion in model container [2025-02-08 06:25:29,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:25:29" (3/3) ... [2025-02-08 06:25:29,875 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2025-02-08 06:25:29,894 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:25:29,896 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test01-1.i that has 2 procedures, 193 locations, 1 initial locations, 4 loop locations, and 92 error locations. [2025-02-08 06:25:29,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:25:29,968 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;@364ff620, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:25:29,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-02-08 06:25:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 193 states, 97 states have (on average 2.1030927835051547) internal successors, (204), 189 states have internal predecessors, (204), 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-02-08 06:25:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:25:29,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:29,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:25:29,983 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-02-08 06:25:29,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:29,990 INFO L85 PathProgramCache]: Analyzing trace with hash 235276, now seen corresponding path program 1 times [2025-02-08 06:25:29,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:29,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071138565] [2025-02-08 06:25:30,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:30,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:30,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:25:30,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:25:30,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:30,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:30,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:30,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071138565] [2025-02-08 06:25:30,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071138565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:30,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:30,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:30,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037190019] [2025-02-08 06:25:30,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:30,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:25:30,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:30,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:25:30,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:25:30,405 INFO L87 Difference]: Start difference. First operand has 193 states, 97 states have (on average 2.1030927835051547) internal successors, (204), 189 states have internal predecessors, (204), 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-02-08 06:25:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:30,688 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2025-02-08 06:25:30,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:25:30,690 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-02-08 06:25:30,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:30,697 INFO L225 Difference]: With dead ends: 187 [2025-02-08 06:25:30,697 INFO L226 Difference]: Without dead ends: 185 [2025-02-08 06:25:30,698 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-02-08 06:25:30,701 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 77 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 317 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-02-08 06:25:30,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 317 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:25:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-08 06:25:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-02-08 06:25:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 2.0104166666666665) 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-02-08 06:25:30,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2025-02-08 06:25:30,748 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 3 [2025-02-08 06:25:30,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:30,748 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2025-02-08 06:25:30,748 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-02-08 06:25:30,748 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2025-02-08 06:25:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:25:30,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:30,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:25:30,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:25:30,749 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-02-08 06:25:30,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:30,750 INFO L85 PathProgramCache]: Analyzing trace with hash 235277, now seen corresponding path program 1 times [2025-02-08 06:25:30,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:30,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060052937] [2025-02-08 06:25:30,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:30,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:30,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:25:30,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:25:30,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:30,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:30,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:30,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060052937] [2025-02-08 06:25:30,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060052937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:30,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:30,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:30,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640747184] [2025-02-08 06:25:30,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:30,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:25:30,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:30,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:25:30,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:25:30,921 INFO L87 Difference]: Start difference. First operand 185 states and 197 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-02-08 06:25:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:31,191 INFO L93 Difference]: Finished difference Result 201 states and 216 transitions. [2025-02-08 06:25:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:25:31,192 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-02-08 06:25:31,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:31,197 INFO L225 Difference]: With dead ends: 201 [2025-02-08 06:25:31,199 INFO L226 Difference]: Without dead ends: 201 [2025-02-08 06:25:31,199 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-02-08 06:25:31,200 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 28 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 390 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-02-08 06:25:31,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 390 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:25:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-08 06:25:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2025-02-08 06:25:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 101 states have (on average 1.9801980198019802) internal successors, (200), 186 states have internal predecessors, (200), 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-02-08 06:25:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2025-02-08 06:25:31,218 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 3 [2025-02-08 06:25:31,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:31,218 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2025-02-08 06:25:31,218 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-02-08 06:25:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2025-02-08 06:25:31,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:25:31,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:31,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:25:31,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:25:31,219 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-02-08 06:25:31,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:31,221 INFO L85 PathProgramCache]: Analyzing trace with hash 7293725, now seen corresponding path program 1 times [2025-02-08 06:25:31,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:31,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133214636] [2025-02-08 06:25:31,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:31,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:25:31,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:25:31,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:31,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:31,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:31,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133214636] [2025-02-08 06:25:31,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133214636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:31,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:31,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:31,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231117733] [2025-02-08 06:25:31,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:31,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:31,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:31,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:31,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:31,279 INFO L87 Difference]: Start difference. First operand 190 states and 204 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-02-08 06:25:31,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:31,427 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2025-02-08 06:25:31,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:31,427 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-02-08 06:25:31,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:31,428 INFO L225 Difference]: With dead ends: 188 [2025-02-08 06:25:31,428 INFO L226 Difference]: Without dead ends: 188 [2025-02-08 06:25:31,429 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-02-08 06:25:31,429 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 15 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 276 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-02-08 06:25:31,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 276 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:31,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-08 06:25:31,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-02-08 06:25:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 101 states have (on average 1.9504950495049505) internal successors, (197), 184 states have internal predecessors, (197), 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-02-08 06:25:31,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2025-02-08 06:25:31,446 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 4 [2025-02-08 06:25:31,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:31,446 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2025-02-08 06:25:31,446 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-02-08 06:25:31,446 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2025-02-08 06:25:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:25:31,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:31,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:25:31,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:25:31,447 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-02-08 06:25:31,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:31,447 INFO L85 PathProgramCache]: Analyzing trace with hash 7293726, now seen corresponding path program 1 times [2025-02-08 06:25:31,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:31,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957294283] [2025-02-08 06:25:31,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:31,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:31,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:25:31,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:25:31,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:31,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:31,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:31,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:31,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957294283] [2025-02-08 06:25:31,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957294283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:31,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:31,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:31,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444133781] [2025-02-08 06:25:31,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:31,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:31,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:31,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:31,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:31,528 INFO L87 Difference]: Start difference. First operand 188 states and 201 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-02-08 06:25:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:31,656 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2025-02-08 06:25:31,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:31,656 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-02-08 06:25:31,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:31,657 INFO L225 Difference]: With dead ends: 186 [2025-02-08 06:25:31,657 INFO L226 Difference]: Without dead ends: 186 [2025-02-08 06:25:31,657 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-02-08 06:25:31,658 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 11 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 283 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-02-08 06:25:31,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 283 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-08 06:25:31,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-02-08 06:25:31,664 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-02-08 06:25:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2025-02-08 06:25:31,666 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 4 [2025-02-08 06:25:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:31,666 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2025-02-08 06:25:31,666 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-02-08 06:25:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2025-02-08 06:25:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:25:31,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:31,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:31,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:25:31,667 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-02-08 06:25:31,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:31,668 INFO L85 PathProgramCache]: Analyzing trace with hash 594610343, now seen corresponding path program 1 times [2025-02-08 06:25:31,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:31,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847821854] [2025-02-08 06:25:31,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:31,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:31,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:25:31,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:25:31,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:31,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:31,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:31,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847821854] [2025-02-08 06:25:31,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847821854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:31,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:31,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:25:31,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811163666] [2025-02-08 06:25:31,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:31,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:25:31,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:31,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:25:31,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:25:31,848 INFO L87 Difference]: Start difference. First operand 186 states and 198 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-02-08 06:25:31,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:31,947 INFO L93 Difference]: Finished difference Result 195 states and 208 transitions. [2025-02-08 06:25:31,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:25:31,947 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-02-08 06:25:31,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:31,948 INFO L225 Difference]: With dead ends: 195 [2025-02-08 06:25:31,948 INFO L226 Difference]: Without dead ends: 195 [2025-02-08 06:25:31,948 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-02-08 06:25:31,949 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 18 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 714 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:31,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 714 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:31,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-08 06:25:31,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2025-02-08 06:25:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 102 states have (on average 1.911764705882353) internal successors, (195), 183 states have internal predecessors, (195), 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-02-08 06:25:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2025-02-08 06:25:31,956 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 9 [2025-02-08 06:25:31,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:31,956 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2025-02-08 06:25:31,956 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-02-08 06:25:31,956 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2025-02-08 06:25:31,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:25:31,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:31,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:31,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:25:31,957 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-02-08 06:25:31,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:31,958 INFO L85 PathProgramCache]: Analyzing trace with hash 179253895, now seen corresponding path program 1 times [2025-02-08 06:25:31,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:31,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357174126] [2025-02-08 06:25:31,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:31,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:31,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:25:31,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:25:31,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:31,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:32,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:32,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357174126] [2025-02-08 06:25:32,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357174126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:32,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:32,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:25:32,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407798242] [2025-02-08 06:25:32,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:32,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:25:32,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:32,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:25:32,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:25:32,055 INFO L87 Difference]: Start difference. First operand 187 states and 199 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-02-08 06:25:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:32,082 INFO L93 Difference]: Finished difference Result 267 states and 283 transitions. [2025-02-08 06:25:32,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:25:32,083 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-02-08 06:25:32,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:32,084 INFO L225 Difference]: With dead ends: 267 [2025-02-08 06:25:32,084 INFO L226 Difference]: Without dead ends: 267 [2025-02-08 06:25:32,085 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-02-08 06:25:32,085 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 84 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 563 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-02-08 06:25:32,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 563 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:25:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-08 06:25:32,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 231. [2025-02-08 06:25:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 145 states have (on average 1.9241379310344828) internal successors, (279), 226 states have internal predecessors, (279), 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-02-08 06:25:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 283 transitions. [2025-02-08 06:25:32,092 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 283 transitions. Word has length 11 [2025-02-08 06:25:32,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:32,092 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 283 transitions. [2025-02-08 06:25:32,092 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-02-08 06:25:32,093 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 283 transitions. [2025-02-08 06:25:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:25:32,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:32,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:32,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:25:32,093 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-02-08 06:25:32,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:32,094 INFO L85 PathProgramCache]: Analyzing trace with hash 464330689, now seen corresponding path program 1 times [2025-02-08 06:25:32,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:32,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050507761] [2025-02-08 06:25:32,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:32,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:32,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:25:32,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:25:32,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:32,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:32,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:32,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050507761] [2025-02-08 06:25:32,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050507761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:32,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:32,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:32,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829375537] [2025-02-08 06:25:32,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:32,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:32,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:32,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:32,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:32,199 INFO L87 Difference]: Start difference. First operand 231 states and 283 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-02-08 06:25:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:32,328 INFO L93 Difference]: Finished difference Result 216 states and 253 transitions. [2025-02-08 06:25:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:32,328 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-02-08 06:25:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:32,329 INFO L225 Difference]: With dead ends: 216 [2025-02-08 06:25:32,329 INFO L226 Difference]: Without dead ends: 216 [2025-02-08 06:25:32,330 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-02-08 06:25:32,330 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 206 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-02-08 06:25:32,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 206 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-08 06:25:32,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-02-08 06:25:32,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 145 states have (on average 1.717241379310345) internal successors, (249), 211 states have internal predecessors, (249), 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-02-08 06:25:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 253 transitions. [2025-02-08 06:25:32,337 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 253 transitions. Word has length 13 [2025-02-08 06:25:32,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:32,337 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 253 transitions. [2025-02-08 06:25:32,337 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-02-08 06:25:32,337 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 253 transitions. [2025-02-08 06:25:32,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:25:32,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:32,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:32,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:25:32,338 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-02-08 06:25:32,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:32,338 INFO L85 PathProgramCache]: Analyzing trace with hash 464330690, now seen corresponding path program 1 times [2025-02-08 06:25:32,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:32,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510481483] [2025-02-08 06:25:32,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:32,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:32,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:25:32,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:25:32,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:32,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:32,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:32,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510481483] [2025-02-08 06:25:32,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510481483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:32,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:32,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:32,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371164292] [2025-02-08 06:25:32,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:32,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:32,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:32,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:32,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:32,450 INFO L87 Difference]: Start difference. First operand 216 states and 253 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-02-08 06:25:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:32,552 INFO L93 Difference]: Finished difference Result 201 states and 223 transitions. [2025-02-08 06:25:32,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:32,553 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-02-08 06:25:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:32,554 INFO L225 Difference]: With dead ends: 201 [2025-02-08 06:25:32,554 INFO L226 Difference]: Without dead ends: 201 [2025-02-08 06:25:32,554 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-02-08 06:25:32,555 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 208 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-02-08 06:25:32,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 208 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-08 06:25:32,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-02-08 06:25:32,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 196 states have internal predecessors, (219), 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-02-08 06:25:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 223 transitions. [2025-02-08 06:25:32,560 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 223 transitions. Word has length 13 [2025-02-08 06:25:32,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:32,560 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 223 transitions. [2025-02-08 06:25:32,560 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-02-08 06:25:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2025-02-08 06:25:32,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 06:25:32,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:32,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:32,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:25:32,561 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-02-08 06:25:32,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:32,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1519638918, now seen corresponding path program 1 times [2025-02-08 06:25:32,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:32,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977675333] [2025-02-08 06:25:32,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:32,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:32,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 06:25:32,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 06:25:32,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:32,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:32,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:32,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977675333] [2025-02-08 06:25:32,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977675333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:32,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:32,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:25:32,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383358887] [2025-02-08 06:25:32,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:32,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:25:32,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:32,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:25:32,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:25:32,684 INFO L87 Difference]: Start difference. First operand 201 states and 223 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-02-08 06:25:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:32,867 INFO L93 Difference]: Finished difference Result 254 states and 289 transitions. [2025-02-08 06:25:32,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:25:32,868 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-02-08 06:25:32,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:32,869 INFO L225 Difference]: With dead ends: 254 [2025-02-08 06:25:32,869 INFO L226 Difference]: Without dead ends: 254 [2025-02-08 06:25:32,869 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-02-08 06:25:32,870 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 24 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 416 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-02-08 06:25:32,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 416 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:25:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-08 06:25:32,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 209. [2025-02-08 06:25:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 204 states have internal predecessors, (231), 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-02-08 06:25:32,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 235 transitions. [2025-02-08 06:25:32,878 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 235 transitions. Word has length 18 [2025-02-08 06:25:32,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:32,878 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 235 transitions. [2025-02-08 06:25:32,878 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-02-08 06:25:32,878 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 235 transitions. [2025-02-08 06:25:32,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 06:25:32,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:32,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:32,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:25:32,879 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-02-08 06:25:32,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:32,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1519638919, now seen corresponding path program 1 times [2025-02-08 06:25:32,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:32,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17351293] [2025-02-08 06:25:32,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:32,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:32,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 06:25:32,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 06:25:32,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:32,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:33,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:33,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17351293] [2025-02-08 06:25:33,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17351293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:33,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:33,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:25:33,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306931242] [2025-02-08 06:25:33,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:33,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:25:33,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:33,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:25:33,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:25:33,104 INFO L87 Difference]: Start difference. First operand 209 states and 235 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-02-08 06:25:33,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:33,347 INFO L93 Difference]: Finished difference Result 209 states and 231 transitions. [2025-02-08 06:25:33,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:25:33,347 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-02-08 06:25:33,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:33,348 INFO L225 Difference]: With dead ends: 209 [2025-02-08 06:25:33,349 INFO L226 Difference]: Without dead ends: 209 [2025-02-08 06:25:33,349 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-02-08 06:25:33,349 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 2 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:33,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 521 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:25:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-08 06:25:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-02-08 06:25:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.4836601307189543) internal successors, (227), 204 states have internal predecessors, (227), 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-02-08 06:25:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 231 transitions. [2025-02-08 06:25:33,359 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 231 transitions. Word has length 18 [2025-02-08 06:25:33,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:33,359 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 231 transitions. [2025-02-08 06:25:33,359 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-02-08 06:25:33,359 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 231 transitions. [2025-02-08 06:25:33,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:25:33,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:33,360 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-02-08 06:25:33,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:25:33,360 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-02-08 06:25:33,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:33,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2073462743, now seen corresponding path program 1 times [2025-02-08 06:25:33,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:33,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956946289] [2025-02-08 06:25:33,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:33,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:33,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:25:33,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:25:33,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:33,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:33,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:33,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956946289] [2025-02-08 06:25:33,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956946289] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:33,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748650504] [2025-02-08 06:25:33,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:33,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:33,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:33,653 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:33,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:25:33,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:25:33,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:25:33,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:33,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:33,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 06:25:33,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:33,818 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:25:33,819 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-02-08 06:25:33,852 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-02-08 06:25:33,959 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:25:33,960 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-02-08 06:25:33,992 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-02-08 06:25:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:25:34,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:34,081 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_160 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ c_create_data_~data~0.offset 4))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse0) v_ArrVal_160) c_create_data_~data~0.base) .cse0))) 1)) is different from false [2025-02-08 06:25:34,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:34,102 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-02-08 06:25:34,106 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-02-08 06:25:34,115 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-02-08 06:25:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-08 06:25:34,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748650504] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:25:34,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:25:34,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2025-02-08 06:25:34,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249663272] [2025-02-08 06:25:34,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:25:34,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 06:25:34,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:34,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 06:25:34,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=113, Unknown=6, NotChecked=22, Total=182 [2025-02-08 06:25:34,151 INFO L87 Difference]: Start difference. First operand 209 states and 231 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-02-08 06:25:34,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:34,472 INFO L93 Difference]: Finished difference Result 210 states and 231 transitions. [2025-02-08 06:25:34,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:25:34,472 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-02-08 06:25:34,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:34,473 INFO L225 Difference]: With dead ends: 210 [2025-02-08 06:25:34,473 INFO L226 Difference]: Without dead ends: 210 [2025-02-08 06:25:34,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=113, Unknown=6, NotChecked=22, Total=182 [2025-02-08 06:25:34,474 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 44 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:34,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 708 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 421 Invalid, 0 Unknown, 91 Unchecked, 0.3s Time] [2025-02-08 06:25:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-08 06:25:34,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2025-02-08 06:25:34,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 153 states have (on average 1.4705882352941178) internal successors, (225), 203 states have internal predecessors, (225), 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-02-08 06:25:34,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 229 transitions. [2025-02-08 06:25:34,481 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 229 transitions. Word has length 23 [2025-02-08 06:25:34,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:34,481 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 229 transitions. [2025-02-08 06:25:34,481 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-02-08 06:25:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 229 transitions. [2025-02-08 06:25:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:25:34,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:34,482 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-02-08 06:25:34,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:25:34,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 06:25:34,683 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-02-08 06:25:34,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2073462744, now seen corresponding path program 1 times [2025-02-08 06:25:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:34,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698656446] [2025-02-08 06:25:34,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:34,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:34,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:25:34,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:25:34,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:34,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:35,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698656446] [2025-02-08 06:25:35,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698656446] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:35,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998762861] [2025-02-08 06:25:35,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:35,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:35,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:35,076 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:35,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:25:35,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:25:35,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:25:35,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:35,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:35,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 06:25:35,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:35,191 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-02-08 06:25:35,197 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-02-08 06:25:35,200 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-02-08 06:25:35,214 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-02-08 06:25:35,221 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-02-08 06:25:35,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:25:35,326 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-02-08 06:25:35,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-02-08 06:25:35,405 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-02-08 06:25:35,412 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-02-08 06:25:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:35,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:35,536 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-02-08 06:25:35,610 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-02-08 06:25:35,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:35,622 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-02-08 06:25:35,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:35,628 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-02-08 06:25:35,636 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-02-08 06:25:35,641 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-02-08 06:25:35,647 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-02-08 06:25:35,649 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-02-08 06:25:35,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:35,659 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-02-08 06:25:35,664 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:25:35,666 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-02-08 06:25:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-08 06:25:35,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998762861] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:25:35,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:25:35,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 18 [2025-02-08 06:25:35,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241434229] [2025-02-08 06:25:35,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:25:35,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 06:25:35,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:35,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 06:25:35,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=210, Unknown=7, NotChecked=62, Total=342 [2025-02-08 06:25:35,701 INFO L87 Difference]: Start difference. First operand 208 states and 229 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-02-08 06:25:36,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:36,247 INFO L93 Difference]: Finished difference Result 228 states and 251 transitions. [2025-02-08 06:25:36,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:25:36,247 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-02-08 06:25:36,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:36,248 INFO L225 Difference]: With dead ends: 228 [2025-02-08 06:25:36,248 INFO L226 Difference]: Without dead ends: 228 [2025-02-08 06:25:36,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=290, Unknown=7, NotChecked=74, Total=462 [2025-02-08 06:25:36,249 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 8 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 1 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:36,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 961 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 542 Invalid, 15 Unknown, 170 Unchecked, 0.4s Time] [2025-02-08 06:25:36,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-08 06:25:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-02-08 06:25:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 173 states have (on average 1.4277456647398843) internal successors, (247), 223 states have internal predecessors, (247), 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-02-08 06:25:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 251 transitions. [2025-02-08 06:25:36,256 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 251 transitions. Word has length 23 [2025-02-08 06:25:36,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:36,256 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 251 transitions. [2025-02-08 06:25:36,256 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-02-08 06:25:36,257 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 251 transitions. [2025-02-08 06:25:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:25:36,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:36,258 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:36,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 06:25:36,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:36,459 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-02-08 06:25:36,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:36,459 INFO L85 PathProgramCache]: Analyzing trace with hash -173612744, now seen corresponding path program 2 times [2025-02-08 06:25:36,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:36,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221084078] [2025-02-08 06:25:36,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:25:36,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:36,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 06:25:36,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:25:36,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:25:36,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:37,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:37,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221084078] [2025-02-08 06:25:37,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221084078] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:37,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599640136] [2025-02-08 06:25:37,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:25:37,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:37,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:37,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:37,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:25:37,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 06:25:37,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:25:37,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:25:37,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:37,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 06:25:37,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:37,233 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-02-08 06:25:37,240 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-02-08 06:25:37,266 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-02-08 06:25:37,275 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-02-08 06:25:37,411 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:25:37,411 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-02-08 06:25:37,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-02-08 06:25:37,528 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:25:37,529 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-02-08 06:25:37,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 06:25:37,651 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:25:37,651 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-02-08 06:25:37,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-02-08 06:25:37,711 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-02-08 06:25:37,715 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-02-08 06:25:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:37,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:37,921 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_306 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 4))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_305) c_create_data_~data~0.base) .cse1))))))) is different from false [2025-02-08 06:25:37,938 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_306 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 8))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_305) c_create_data_~data~0.base) .cse1))))))) is different from false [2025-02-08 06:25:37,952 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_304) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_303) c_create_data_~data~0.base) .cse1) v_ArrVal_306) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_303))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_304) .cse2 v_ArrVal_306) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_305) c_create_data_~data~0.base) .cse1)))))))) is different from false [2025-02-08 06:25:38,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse3 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_302))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_303))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (<= (+ 16 .cse0 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_301) .cse1 v_ArrVal_304) .cse2 v_ArrVal_306) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_305) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= 0 (+ .cse0 12 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_302))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_301) .cse6 v_ArrVal_304) (select (select (store .cse7 .cse6 v_ArrVal_303) c_create_data_~data~0.base) .cse3) v_ArrVal_306))) c_create_data_~data~0.base) .cse3)))))) is different from false [2025-02-08 06:25:38,190 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3)) (.cse4 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_302))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_303))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_301) .cse1 v_ArrVal_304) .cse2 v_ArrVal_306) c_create_data_~data~0.base) .cse3) 16 .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_305) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_302))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_301) .cse7 v_ArrVal_304) (select (select (store .cse8 .cse7 v_ArrVal_303) c_create_data_~data~0.base) .cse3) v_ArrVal_306))) c_create_data_~data~0.base) .cse3) .cse4 12)))))) is different from false [2025-02-08 06:25:38,219 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_302))) (let ((.cse1 (select (select .cse2 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_301) .cse1 v_ArrVal_304) (select (select (store .cse2 .cse1 v_ArrVal_303) c_create_data_~data~0.base) .cse3) v_ArrVal_306))) c_create_data_~data~0.base) .cse3) 12))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_302))) (let ((.cse4 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_303))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_301) .cse4 v_ArrVal_304) .cse5 v_ArrVal_306) c_create_data_~data~0.base) .cse3) 16) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_305) c_create_data_~data~0.base) .cse3))))))))))) is different from false [2025-02-08 06:25:38,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:38,230 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 177 treesize of output 178 [2025-02-08 06:25:38,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:38,239 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 167 treesize of output 108 [2025-02-08 06:25:38,248 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 12906 treesize of output 11280 [2025-02-08 06:25:38,321 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 6179 treesize of output 6017 [2025-02-08 06:25:38,343 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 280 treesize of output 240 [2025-02-08 06:25:38,383 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 240 treesize of output 224 [2025-02-08 06:25:38,387 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 224 treesize of output 212 [2025-02-08 06:25:38,391 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 212 treesize of output 172 [2025-02-08 06:25:38,397 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 136 treesize of output 132 [2025-02-08 06:25:38,402 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 168 treesize of output 156 [2025-02-08 06:25:38,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:38,434 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 90 treesize of output 91 [2025-02-08 06:25:38,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:38,442 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 80 treesize of output 61 [2025-02-08 06:25:38,445 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:25:38,447 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 85 treesize of output 55 [2025-02-08 06:25:38,450 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:25:38,452 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-02-08 06:25:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 22 not checked. [2025-02-08 06:25:38,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599640136] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:25:38,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:25:38,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 35 [2025-02-08 06:25:38,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704362810] [2025-02-08 06:25:38,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:25:38,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-08 06:25:38,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:38,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-08 06:25:38,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=693, Unknown=35, NotChecked=366, Total=1260 [2025-02-08 06:25:38,487 INFO L87 Difference]: Start difference. First operand 228 states and 251 transitions. Second operand has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 states have internal predecessors, (76), 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-02-08 06:25:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:40,202 INFO L93 Difference]: Finished difference Result 268 states and 291 transitions. [2025-02-08 06:25:40,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 06:25:40,203 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 states have internal predecessors, (76), 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 33 [2025-02-08 06:25:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:40,204 INFO L225 Difference]: With dead ends: 268 [2025-02-08 06:25:40,204 INFO L226 Difference]: Without dead ends: 268 [2025-02-08 06:25:40,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=328, Invalid=1299, Unknown=37, NotChecked=498, Total=2162 [2025-02-08 06:25:40,206 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 37 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 15 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 621 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:40,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1869 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1120 Invalid, 7 Unknown, 621 Unchecked, 0.9s Time] [2025-02-08 06:25:40,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-08 06:25:40,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-02-08 06:25:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 213 states have (on average 1.3474178403755868) internal successors, (287), 263 states have internal predecessors, (287), 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-02-08 06:25:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 291 transitions. [2025-02-08 06:25:40,213 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 291 transitions. Word has length 33 [2025-02-08 06:25:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:40,213 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 291 transitions. [2025-02-08 06:25:40,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 36 states have internal predecessors, (76), 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-02-08 06:25:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 291 transitions. [2025-02-08 06:25:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 06:25:40,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:40,214 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:40,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:25:40,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:40,415 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-02-08 06:25:40,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:40,415 INFO L85 PathProgramCache]: Analyzing trace with hash 744811512, now seen corresponding path program 3 times [2025-02-08 06:25:40,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:40,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994795384] [2025-02-08 06:25:40,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:25:40,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:40,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 8 equivalence classes. [2025-02-08 06:25:40,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 06:25:40,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-08 06:25:40,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:42,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:42,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994795384] [2025-02-08 06:25:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994795384] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:42,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115585210] [2025-02-08 06:25:42,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:25:42,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:42,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:42,069 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:42,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:25:42,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 8 equivalence classes. [2025-02-08 06:25:42,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 06:25:42,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-08 06:25:42,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:42,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-08 06:25:42,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:42,575 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-02-08 06:25:42,580 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-02-08 06:25:42,585 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-02-08 06:25:42,621 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-02-08 06:25:42,625 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-02-08 06:25:42,754 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:25:42,754 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-02-08 06:25:42,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-02-08 06:25:42,893 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:25:42,894 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-02-08 06:25:42,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-02-08 06:25:43,027 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:25:43,028 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-02-08 06:25:43,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-02-08 06:25:43,146 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:25:43,146 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-02-08 06:25:43,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 06:25:43,247 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:25:43,247 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-02-08 06:25:43,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-02-08 06:25:43,381 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:25:43,381 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-02-08 06:25:43,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-08 06:25:43,532 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:25:43,532 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-02-08 06:25:43,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2025-02-08 06:25:43,594 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-02-08 06:25:43,598 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-02-08 06:25:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:43,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:43,727 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_449 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_449) c_create_data_~data~0.base) .cse1) 4))) (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_449) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_448) c_create_data_~data~0.base) .cse1)))))) is different from false [2025-02-08 06:25:43,742 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_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_449) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_448) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_449 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_449) c_create_data_~data~0.base) .cse1) .cse2 4)))))) is different from false [2025-02-08 06:25:44,190 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_445)) (.cse4 (* c_create_data_~counter~0 4))) (or (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_444))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_447))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (< (+ (select (select (store (store .cse0 .cse1 v_ArrVal_446) .cse2 v_ArrVal_449) c_create_data_~data~0.base) .cse3) .cse4 15) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_448) c_create_data_~data~0.base) .cse3)))))))) (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse3) .cse4 4) 0)))) (forall ((v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_445))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (or (< c_create_data_~counter~0 (div (+ (- 1) (* (- 1) .cse7)) 4)) (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_449 (Array Int Int))) (< (+ (mod (+ 3 (* 3 .cse7)) 4) .cse7) (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_444))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse3))) (store (store .cse8 .cse9 v_ArrVal_446) (select (select (store .cse10 .cse9 v_ArrVal_447) c_create_data_~data~0.base) .cse3) v_ArrVal_449))) c_create_data_~data~0.base) .cse3) 12))))))))) is different from false [2025-02-08 06:25:44,548 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))) (and (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse4 (* c_create_data_~counter~0 4)) (.cse0 (store |c_#memory_$Pointer$#2.offset| .cse7 v_ArrVal_445))) (or (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_444))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_447))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (< (+ 19 (select (select (store (store .cse0 .cse1 v_ArrVal_446) .cse2 v_ArrVal_449) c_create_data_~data~0.base) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_448) c_create_data_~data~0.base) .cse3))))))) (< (+ .cse4 8 (select (select .cse0 c_create_data_~data~0.base) .cse3)) 0)))) (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| .cse7 v_ArrVal_445))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse3))) (or (< (+ .cse8 (mod (+ 3 (* 3 .cse8)) 4)) (+ (select (select (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_444))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse3))) (store (store .cse9 .cse10 v_ArrVal_446) (select (select (store .cse11 .cse10 v_ArrVal_447) c_create_data_~data~0.base) .cse3) v_ArrVal_449))) c_create_data_~data~0.base) .cse3) 12)) (< (+ c_create_data_~counter~0 1) (div (+ (* (- 1) .cse8) (- 1)) 4))))))))) is different from false [2025-02-08 06:25:44,590 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_442))) (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_443) .cse6 v_ArrVal_445))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ c_create_data_~counter~0 1) (div (+ (- 1) (* (- 1) .cse0)) 4)) (< (+ .cse0 (mod (+ (* .cse0 3) 3) 4)) (+ (select (select (let ((.cse3 (store .cse5 .cse6 v_ArrVal_444))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store .cse1 .cse2 v_ArrVal_446) (select (select (store .cse3 .cse2 v_ArrVal_447) c_create_data_~data~0.base) .cse4) v_ArrVal_449))) c_create_data_~data~0.base) .cse4) 12)))))))) (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_442))) (let ((.cse14 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse8 (* c_create_data_~counter~0 4)) (.cse7 (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_443) .cse14 v_ArrVal_445))) (or (< (+ (select (select .cse7 c_create_data_~data~0.base) .cse4) .cse8 8) 0) (let ((.cse12 (store .cse13 .cse14 v_ArrVal_444))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_447))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (< (+ 19 .cse8 (select (select (store (store .cse7 .cse9 v_ArrVal_446) .cse10 v_ArrVal_449) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_448) c_create_data_~data~0.base) .cse4)))))))))))))) is different from false [2025-02-08 06:25:44,662 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_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_442))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store |c_#memory_$Pointer$#2.offset| .cse7 v_ArrVal_443) .cse6 v_ArrVal_445))) (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 .cse0) 3) 4) .cse0) (+ 12 (select (select (let ((.cse3 (store .cse5 .cse6 v_ArrVal_444))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store .cse1 .cse2 v_ArrVal_446) (select (select (store .cse3 .cse2 v_ArrVal_447) c_create_data_~data~0.base) .cse4) v_ArrVal_449))) c_create_data_~data~0.base) .cse4))))))))) (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_442))) (let ((.cse15 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse8 (* c_create_data_~counter~0 4)) (.cse9 (store (store |c_#memory_$Pointer$#2.offset| .cse7 v_ArrVal_443) .cse15 v_ArrVal_445))) (or (< (+ .cse8 (select (select .cse9 c_create_data_~data~0.base) .cse4) 8) 0) (let ((.cse13 (store .cse14 .cse15 v_ArrVal_444))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_447))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (< (+ 19 .cse8 (select (select (store (store .cse9 .cse10 v_ArrVal_446) .cse11 v_ArrVal_449) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse12 .cse11 v_ArrVal_448) c_create_data_~data~0.base) .cse4))))))))))))))) is different from false [2025-02-08 06:25:44,746 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_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_442))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_443) .cse8 v_ArrVal_445))) (or (< (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2) 12) 0) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_444))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_447))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (< (+ 23 .cse0 (select (select (store (store .cse1 .cse3 v_ArrVal_446) .cse4 v_ArrVal_449) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_448) c_create_data_~data~0.base) .cse2)))))))))))) (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_442))) (let ((.cse15 (select (select .cse14 c_create_data_~data~0.base) .cse2))) (let ((.cse11 (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_443) .cse15 v_ArrVal_445))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse2))) (or (< (+ (mod (+ (* 3 .cse10) 3) 4) .cse10) (+ 12 (select (select (let ((.cse13 (store .cse14 .cse15 v_ArrVal_444))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse2))) (store (store .cse11 .cse12 v_ArrVal_446) (select (select (store .cse13 .cse12 v_ArrVal_447) c_create_data_~data~0.base) .cse2) v_ArrVal_449))) c_create_data_~data~0.base) .cse2))) (< (+ c_create_data_~counter~0 2) (div (+ (- 1) (* (- 1) .cse10)) 4))))))))))) is different from false [2025-02-08 06:25:44,809 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_441))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse1))) (let ((.cse7 (store .cse10 .cse9 v_ArrVal_442))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse1))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_440) .cse9 v_ArrVal_443) .cse8 v_ArrVal_445))) (or (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2 12) 0) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_444))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse1))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_447))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse1))) (< (+ 23 .cse2 (select (select (store (store .cse0 .cse3 v_ArrVal_446) .cse4 v_ArrVal_449) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_448) c_create_data_~data~0.base) .cse1)))))))))))))) (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_441))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse1))) (let ((.cse15 (store .cse18 .cse17 v_ArrVal_442))) (let ((.cse16 (select (select .cse15 c_create_data_~data~0.base) .cse1))) (let ((.cse12 (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_440) .cse17 v_ArrVal_443) .cse16 v_ArrVal_445))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse1))) (or (< (+ c_create_data_~counter~0 2) (div (+ (- 1) (* (- 1) .cse11)) 4)) (< (+ .cse11 (mod (+ 3 (* .cse11 3)) 4)) (+ (select (select (let ((.cse14 (store .cse15 .cse16 v_ArrVal_444))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse1))) (store (store .cse12 .cse13 v_ArrVal_446) (select (select (store .cse14 .cse13 v_ArrVal_447) c_create_data_~data~0.base) .cse1) v_ArrVal_449))) c_create_data_~data~0.base) .cse1) 12)))))))))))) is different from false [2025-02-08 06:25:46,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_441))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse11 .cse10 v_ArrVal_442))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_440) .cse10 v_ArrVal_443) .cse8 v_ArrVal_445)) (.cse0 (* c_create_data_~counter~0 4))) (or (let ((.cse6 (store .cse7 .cse8 v_ArrVal_444))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_447))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (< (+ .cse0 (select (select (store (store .cse1 .cse2 v_ArrVal_446) .cse3 v_ArrVal_449) c_create_data_~data~0.base) .cse4) 27) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_448) c_create_data_~data~0.base) .cse4))))))) (< (+ (select (select .cse1 c_create_data_~data~0.base) .cse4) 16 .cse0) 0)))))))) (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_441))) (let ((.cse18 (select (select .cse19 c_create_data_~data~0.base) .cse4))) (let ((.cse16 (store .cse19 .cse18 v_ArrVal_442))) (let ((.cse17 (select (select .cse16 c_create_data_~data~0.base) .cse4))) (let ((.cse13 (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_440) .cse18 v_ArrVal_443) .cse17 v_ArrVal_445))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (or (< (+ .cse12 (mod (+ 3 (* .cse12 3)) 4)) (+ (select (select (let ((.cse15 (store .cse16 .cse17 v_ArrVal_444))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (store (store .cse13 .cse14 v_ArrVal_446) (select (select (store .cse15 .cse14 v_ArrVal_447) c_create_data_~data~0.base) .cse4) v_ArrVal_449))) c_create_data_~data~0.base) .cse4) 12)) (< (+ c_create_data_~counter~0 3) (div (+ (* (- 1) .cse12) (- 1)) 4))))))))))))) is different from false [2025-02-08 06:25:50,467 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_438))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_441))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse11 .cse10 v_ArrVal_442))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_439) .cse9 v_ArrVal_440) .cse10 v_ArrVal_443) .cse8 v_ArrVal_445)) (.cse0 (* c_create_data_~counter~0 4))) (or (let ((.cse6 (store .cse7 .cse8 v_ArrVal_444))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_447))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (< (+ .cse0 (select (select (store (store .cse1 .cse2 v_ArrVal_446) .cse3 v_ArrVal_449) c_create_data_~data~0.base) .cse4) 27) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_448) c_create_data_~data~0.base) .cse4))))))) (< (+ (select (select .cse1 c_create_data_~data~0.base) .cse4) 16 .cse0) 0)))))))))) (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_438))) (let ((.cse19 (select (select .cse22 c_create_data_~data~0.base) .cse4))) (let ((.cse21 (store .cse22 .cse19 v_ArrVal_441))) (let ((.cse20 (select (select .cse21 c_create_data_~data~0.base) .cse4))) (let ((.cse17 (store .cse21 .cse20 v_ArrVal_442))) (let ((.cse18 (select (select .cse17 c_create_data_~data~0.base) .cse4))) (let ((.cse14 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_439) .cse19 v_ArrVal_440) .cse20 v_ArrVal_443) .cse18 v_ArrVal_445))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (or (< (+ c_create_data_~counter~0 3) (div (+ (- 1) (* .cse13 (- 1))) 4)) (< (+ .cse13 (mod (+ (* .cse13 3) 3) 4)) (+ 12 (select (select (let ((.cse16 (store .cse17 .cse18 v_ArrVal_444))) (let ((.cse15 (select (select .cse16 c_create_data_~data~0.base) .cse4))) (store (store .cse14 .cse15 v_ArrVal_446) (select (select (store .cse16 .cse15 v_ArrVal_447) c_create_data_~data~0.base) .cse4) v_ArrVal_449))) c_create_data_~data~0.base) .cse4))))))))))))))) is different from false [2025-02-08 06:25:53,017 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_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_438))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_441))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse10 .cse9 v_ArrVal_442))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse7 v_ArrVal_439) .cse8 v_ArrVal_440) .cse9 v_ArrVal_443) .cse6 v_ArrVal_445))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse4))) (or (< (+ (mod (+ 3 (* 3 .cse0)) 4) .cse0) (+ 12 (select (select (let ((.cse3 (store .cse5 .cse6 v_ArrVal_444))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store .cse1 .cse2 v_ArrVal_446) (select (select (store .cse3 .cse2 v_ArrVal_447) c_create_data_~data~0.base) .cse4) v_ArrVal_449))) c_create_data_~data~0.base) .cse4))) (< (+ c_create_data_~counter~0 3) (div (+ (- 1) (* (- 1) .cse0)) 4)))))))))))) (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_438))) (let ((.cse20 (select (select .cse23 c_create_data_~data~0.base) .cse4))) (let ((.cse22 (store .cse23 .cse20 v_ArrVal_441))) (let ((.cse21 (select (select .cse22 c_create_data_~data~0.base) .cse4))) (let ((.cse18 (store .cse22 .cse21 v_ArrVal_442))) (let ((.cse19 (select (select .cse18 c_create_data_~data~0.base) .cse4))) (let ((.cse12 (* c_create_data_~counter~0 4)) (.cse13 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse7 v_ArrVal_439) .cse20 v_ArrVal_440) .cse21 v_ArrVal_443) .cse19 v_ArrVal_445))) (or (< (+ 16 .cse12 (select (select .cse13 c_create_data_~data~0.base) .cse4)) 0) (let ((.cse17 (store .cse18 .cse19 v_ArrVal_444))) (let ((.cse14 (select (select .cse17 c_create_data_~data~0.base) .cse4))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_447))) (let ((.cse15 (select (select .cse16 c_create_data_~data~0.base) .cse4))) (< (+ .cse12 27 (select (select (store (store .cse13 .cse14 v_ArrVal_446) .cse15 v_ArrVal_449) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse16 .cse15 v_ArrVal_448) c_create_data_~data~0.base) .cse4))))))))))))))))))) is different from false [2025-02-08 06:25:53,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_438))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_441))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse12 .cse11 v_ArrVal_442))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_439) .cse10 v_ArrVal_440) .cse11 v_ArrVal_443) .cse8 v_ArrVal_445))) (or (let ((.cse6 (store .cse7 .cse8 v_ArrVal_444))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_447))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (< (+ 31 .cse0 (select (select (store (store .cse1 .cse2 v_ArrVal_446) .cse3 v_ArrVal_449) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_448) c_create_data_~data~0.base) .cse4))))))) (< (+ .cse0 20 (select (select .cse1 c_create_data_~data~0.base) .cse4)) 0)))))))))) (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_438))) (let ((.cse20 (select (select .cse23 c_create_data_~data~0.base) .cse4))) (let ((.cse22 (store .cse23 .cse20 v_ArrVal_441))) (let ((.cse21 (select (select .cse22 c_create_data_~data~0.base) .cse4))) (let ((.cse18 (store .cse22 .cse21 v_ArrVal_442))) (let ((.cse19 (select (select .cse18 c_create_data_~data~0.base) .cse4))) (let ((.cse15 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_439) .cse20 v_ArrVal_440) .cse21 v_ArrVal_443) .cse19 v_ArrVal_445))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (or (< (+ (mod (+ 3 (* 3 .cse14)) 4) .cse14) (+ 12 (select (select (let ((.cse17 (store .cse18 .cse19 v_ArrVal_444))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse4))) (store (store .cse15 .cse16 v_ArrVal_446) (select (select (store .cse17 .cse16 v_ArrVal_447) c_create_data_~data~0.base) .cse4) v_ArrVal_449))) c_create_data_~data~0.base) .cse4))) (< (+ c_create_data_~counter~0 4) (div (+ (- 1) (* (- 1) .cse14)) 4))))))))))))))) is different from false [2025-02-08 06:25:57,579 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_436 (Array Int Int)) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_439 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_437))) (let ((.cse9 (select (select .cse14 c_create_data_~data~0.base) .cse2))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_438))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse2))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_441))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse2))) (let ((.cse7 (store .cse12 .cse11 v_ArrVal_442))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (let ((.cse1 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_436) .cse9 v_ArrVal_439) .cse10 v_ArrVal_440) .cse11 v_ArrVal_443) .cse8 v_ArrVal_445)) (.cse0 (* c_create_data_~counter~0 4))) (or (< (+ .cse0 20 (select (select .cse1 c_create_data_~data~0.base) .cse2)) 0) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_444))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_447))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (< (+ (select (select (store (store .cse1 .cse3 v_ArrVal_446) .cse4 v_ArrVal_449) c_create_data_~data~0.base) .cse2) 31 .cse0) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_448) c_create_data_~data~0.base) .cse2)))))))))))))))))) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_436 (Array Int Int)) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_439 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_437))) (let ((.cse21 (select (select .cse26 c_create_data_~data~0.base) .cse2))) (let ((.cse25 (store .cse26 .cse21 v_ArrVal_438))) (let ((.cse22 (select (select .cse25 c_create_data_~data~0.base) .cse2))) (let ((.cse24 (store .cse25 .cse22 v_ArrVal_441))) (let ((.cse23 (select (select .cse24 c_create_data_~data~0.base) .cse2))) (let ((.cse19 (store .cse24 .cse23 v_ArrVal_442))) (let ((.cse20 (select (select .cse19 c_create_data_~data~0.base) .cse2))) (let ((.cse16 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_436) .cse21 v_ArrVal_439) .cse22 v_ArrVal_440) .cse23 v_ArrVal_443) .cse20 v_ArrVal_445))) (let ((.cse15 (select (select .cse16 c_create_data_~data~0.base) .cse2))) (or (< (+ (mod (+ (* 3 .cse15) 3) 4) .cse15) (+ (select (select (let ((.cse18 (store .cse19 .cse20 v_ArrVal_444))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse2))) (store (store .cse16 .cse17 v_ArrVal_446) (select (select (store .cse18 .cse17 v_ArrVal_447) c_create_data_~data~0.base) .cse2) v_ArrVal_449))) c_create_data_~data~0.base) .cse2) 12)) (< (+ c_create_data_~counter~0 4) (div (+ (- 1) (* (- 1) .cse15)) 4)))))))))))))))) is different from false [2025-02-08 06:26:02,458 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_436 (Array Int Int)) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_439 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_437))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse3))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_438))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse3))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_441))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse3))) (let ((.cse7 (store .cse13 .cse12 v_ArrVal_442))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_436) .cse10 v_ArrVal_439) .cse11 v_ArrVal_440) .cse12 v_ArrVal_443) .cse8 v_ArrVal_445)) (.cse4 (* c_create_data_~counter~0 4))) (or (let ((.cse6 (store .cse7 .cse8 v_ArrVal_444))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_447))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (< (+ (select (select (store (store .cse0 .cse1 v_ArrVal_446) .cse2 v_ArrVal_449) c_create_data_~data~0.base) .cse3) 31 .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_448) c_create_data_~data~0.base) .cse3))))))) (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse3) .cse4 20) 0)))))))))))) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_436 (Array Int Int)) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_439 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_437))) (let ((.cse22 (select (select .cse27 c_create_data_~data~0.base) .cse3))) (let ((.cse26 (store .cse27 .cse22 v_ArrVal_438))) (let ((.cse23 (select (select .cse26 c_create_data_~data~0.base) .cse3))) (let ((.cse25 (store .cse26 .cse23 v_ArrVal_441))) (let ((.cse24 (select (select .cse25 c_create_data_~data~0.base) .cse3))) (let ((.cse20 (store .cse25 .cse24 v_ArrVal_442))) (let ((.cse21 (select (select .cse20 c_create_data_~data~0.base) .cse3))) (let ((.cse17 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_436) .cse22 v_ArrVal_439) .cse23 v_ArrVal_440) .cse24 v_ArrVal_443) .cse21 v_ArrVal_445))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse3))) (or (< (+ .cse16 (mod (+ 3 (* .cse16 3)) 4)) (+ (select (select (let ((.cse19 (store .cse20 .cse21 v_ArrVal_444))) (let ((.cse18 (select (select .cse19 c_create_data_~data~0.base) .cse3))) (store (store .cse17 .cse18 v_ArrVal_446) (select (select (store .cse19 .cse18 v_ArrVal_447) c_create_data_~data~0.base) .cse3) v_ArrVal_449))) c_create_data_~data~0.base) .cse3) 12)) (< (+ c_create_data_~counter~0 4) (div (+ (- 1) (* (- 1) .cse16)) 4))))))))))))))))) is different from false [2025-02-08 06:26:07,157 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_436 (Array Int Int)) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_439 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_437))) (let ((.cse9 (select (select .cse14 c_create_data_~data~0.base) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_438))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_441))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse1))) (let ((.cse6 (store .cse12 .cse11 v_ArrVal_442))) (let ((.cse7 (select (select .cse6 c_create_data_~data~0.base) .cse1))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_436) .cse9 v_ArrVal_439) .cse10 v_ArrVal_440) .cse11 v_ArrVal_443) .cse7 v_ArrVal_445))) (or (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) 20) 0) (let ((.cse5 (store .cse6 .cse7 v_ArrVal_444))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse1))) (let ((.cse4 (store .cse5 .cse2 v_ArrVal_447))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (< (+ (select (select (store (store .cse0 .cse2 v_ArrVal_446) .cse3 v_ArrVal_449) c_create_data_~data~0.base) .cse1) 31) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_448) c_create_data_~data~0.base) .cse1)))))))))))))))))) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int)) (v_ArrVal_436 (Array Int Int)) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_439 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$#2.base| .cse8 v_ArrVal_437))) (let ((.cse21 (select (select .cse26 c_create_data_~data~0.base) .cse1))) (let ((.cse25 (store .cse26 .cse21 v_ArrVal_438))) (let ((.cse22 (select (select .cse25 c_create_data_~data~0.base) .cse1))) (let ((.cse24 (store .cse25 .cse22 v_ArrVal_441))) (let ((.cse23 (select (select .cse24 c_create_data_~data~0.base) .cse1))) (let ((.cse19 (store .cse24 .cse23 v_ArrVal_442))) (let ((.cse20 (select (select .cse19 c_create_data_~data~0.base) .cse1))) (let ((.cse16 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse8 v_ArrVal_436) .cse21 v_ArrVal_439) .cse22 v_ArrVal_440) .cse23 v_ArrVal_443) .cse20 v_ArrVal_445))) (let ((.cse15 (select (select .cse16 c_create_data_~data~0.base) .cse1))) (or (< (+ .cse15 (mod (+ 3 (* .cse15 3)) 4)) (+ (select (select (let ((.cse18 (store .cse19 .cse20 v_ArrVal_444))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse1))) (store (store .cse16 .cse17 v_ArrVal_446) (select (select (store .cse18 .cse17 v_ArrVal_447) c_create_data_~data~0.base) .cse1) v_ArrVal_449))) c_create_data_~data~0.base) .cse1) 12)) (< 4 (div (+ (- 1) (* (- 1) .cse15)) 4))))))))))))))))) is different from false [2025-02-08 06:26:07,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:07,282 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 2475 treesize of output 2445 [2025-02-08 06:26:07,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:07,343 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 2435 treesize of output 1365 [2025-02-08 06:26:08,658 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 198989650610116353 treesize of output 173709900626632971