./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:42:25,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:42:25,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:42:25,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:42:25,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:42:25,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:42:25,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:42:25,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:42:25,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:42:25,145 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:42:25,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:42:25,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:42:25,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:42:25,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:42:25,145 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:42:25,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:42:25,145 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:42:25,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:42:25,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:42:25,146 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:42:25,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:42:25,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:42:25,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:42:25,147 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2025-03-09 00:42:25,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:42:25,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:42:25,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:42:25,382 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:42:25,383 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:42:25,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2025-03-09 00:42:26,469 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/678ef4d78/9ee1174a50a04476a95aa704d16a9d24/FLAGd9978df99 [2025-03-09 00:42:26,766 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:42:26,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2025-03-09 00:42:26,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/678ef4d78/9ee1174a50a04476a95aa704d16a9d24/FLAGd9978df99 [2025-03-09 00:42:27,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/678ef4d78/9ee1174a50a04476a95aa704d16a9d24 [2025-03-09 00:42:27,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:42:27,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:42:27,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:42:27,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:42:27,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:42:27,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:42:27" (1/1) ... [2025-03-09 00:42:27,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10ab50b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:27, skipping insertion in model container [2025-03-09 00:42:27,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:42:27" (1/1) ... [2025-03-09 00:42:27,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:42:27,328 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,357 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,361 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,364 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,369 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,388 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,388 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,389 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,390 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,391 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,392 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,393 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,394 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,397 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,397 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,402 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,403 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,403 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,404 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,406 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:27,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:42:27,424 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2025-03-09 00:42:27,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4b5ade0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:27, skipping insertion in model container [2025-03-09 00:42:27,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:42:27,425 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-09 00:42:27,426 INFO L158 Benchmark]: Toolchain (without parser) took 398.76ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 101.0MB in the end (delta: 19.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 00:42:27,426 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:42:27,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.65ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 101.0MB in the end (delta: 19.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 00:42:27,427 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.65ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 101.0MB in the end (delta: 19.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 750]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:42:29,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:42:29,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-09 00:42:29,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:42:29,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:42:29,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:42:29,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:42:29,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:42:29,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:42:29,135 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:42:29,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:42:29,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:42:29,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:42:29,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:42:29,135 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:42:29,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:42:29,135 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:42:29,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:42:29,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:42:29,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:42:29,136 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:42:29,136 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:42:29,136 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:42:29,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:42:29,136 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:42:29,136 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 00:42:29,136 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 00:42:29,136 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:42:29,136 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:42:29,136 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:42:29,136 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:42:29,136 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:42:29,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:42:29,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:42:29,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:42:29,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:42:29,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:42:29,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:42:29,137 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 00:42:29,137 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 00:42:29,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:42:29,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:42:29,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:42:29,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:42:29,138 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2025-03-09 00:42:29,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:42:29,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:42:29,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:42:29,365 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:42:29,366 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:42:29,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2025-03-09 00:42:30,536 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47edf9a5/5372150aa08d41eb8d0be774efc723c2/FLAGb2cf64d5c [2025-03-09 00:42:30,801 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:42:30,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2025-03-09 00:42:30,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47edf9a5/5372150aa08d41eb8d0be774efc723c2/FLAGb2cf64d5c [2025-03-09 00:42:31,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47edf9a5/5372150aa08d41eb8d0be774efc723c2 [2025-03-09 00:42:31,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:42:31,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:42:31,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:42:31,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:42:31,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:42:31,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:42:31" (1/1) ... [2025-03-09 00:42:31,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac410c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:31, skipping insertion in model container [2025-03-09 00:42:31,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:42:31" (1/1) ... [2025-03-09 00:42:31,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:42:31,374 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,405 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,409 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,414 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,419 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,447 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,447 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,449 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,449 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,451 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,452 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,453 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,453 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,456 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,459 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,460 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,461 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,462 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,462 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,465 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:42:31,480 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-09 00:42:31,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:42:31,528 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,550 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,553 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,554 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,559 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,579 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,579 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,583 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,584 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,585 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,585 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,586 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,587 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,589 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,592 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,593 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,595 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,596 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,596 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,600 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:42:31,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:42:31,609 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:42:31,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:42:31,717 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:42:31,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:31 WrapperNode [2025-03-09 00:42:31,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:42:31,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:42:31,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:42:31,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:42:31,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:31" (1/1) ... [2025-03-09 00:42:31,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:31" (1/1) ... [2025-03-09 00:42:31,799 INFO L138 Inliner]: procedures = 180, calls = 325, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1165 [2025-03-09 00:42:31,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:42:31,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:42:31,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:42:31,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:42:31,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:31" (1/1) ... [2025-03-09 00:42:31,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:31" (1/1) ... [2025-03-09 00:42:31,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:31" (1/1) ... [2025-03-09 00:42:31,905 INFO L175 MemorySlicer]: Split 302 memory accesses to 3 slices as follows [2, 266, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2025-03-09 00:42:31,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:31" (1/1) ... [2025-03-09 00:42:31,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:31" (1/1) ... [2025-03-09 00:42:31,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:31" (1/1) ... [2025-03-09 00:42:31,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:31" (1/1) ... [2025-03-09 00:42:31,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:31" (1/1) ... [2025-03-09 00:42:31,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:31" (1/1) ... [2025-03-09 00:42:31,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:42:31,952 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:42:31,952 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:42:31,952 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:42:31,953 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:31" (1/1) ... [2025-03-09 00:42:31,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:42:31,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:31,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:42:31,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:42:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-09 00:42:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-09 00:42:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-09 00:42:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-09 00:42:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-09 00:42:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-09 00:42:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 00:42:31,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 00:42:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 00:42:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 00:42:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-09 00:42:31,992 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 00:42:31,992 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 00:42:31,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-09 00:42:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:42:31,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:42:32,144 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:42:32,145 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:42:34,809 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-09 00:42:34,902 INFO L? ?]: Removed 1298 outVars from TransFormulas that were not future-live. [2025-03-09 00:42:34,902 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:42:34,932 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:42:34,933 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:42:34,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:42:34 BoogieIcfgContainer [2025-03-09 00:42:34,934 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:42:34,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:42:34,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:42:34,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:42:34,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:42:31" (1/3) ... [2025-03-09 00:42:34,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5345625c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:42:34, skipping insertion in model container [2025-03-09 00:42:34,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:42:31" (2/3) ... [2025-03-09 00:42:34,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5345625c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:42:34, skipping insertion in model container [2025-03-09 00:42:34,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:42:34" (3/3) ... [2025-03-09 00:42:34,944 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test3-2.i [2025-03-09 00:42:34,955 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:42:34,956 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test3-2.i that has 5 procedures, 1262 locations, 1 initial locations, 41 loop locations, and 630 error locations. [2025-03-09 00:42:34,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:42:35,011 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;@4273fcb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:42:35,012 INFO L334 AbstractCegarLoop]: Starting to check reachability of 630 error locations. [2025-03-09 00:42:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 1252 states, 617 states have (on average 2.2414910858995136) internal successors, (1383), 1245 states have internal predecessors, (1383), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:42:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 00:42:35,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:35,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 00:42:35,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:42:35,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:35,029 INFO L85 PathProgramCache]: Analyzing trace with hash 43772419, now seen corresponding path program 1 times [2025-03-09 00:42:35,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:42:35,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1559465097] [2025-03-09 00:42:35,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:35,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:35,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:35,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:42:35,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:42:35,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 00:42:35,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 00:42:35,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:35,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:35,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:42:35,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:42:35,237 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_48|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_48| (_ bv0 1))))) is different from true [2025-03-09 00:42:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:35,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:42:35,242 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:42:35,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559465097] [2025-03-09 00:42:35,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559465097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:35,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:35,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:42:35,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435885749] [2025-03-09 00:42:35,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:35,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:42:35,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:42:35,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:42:35,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2025-03-09 00:42:35,267 INFO L87 Difference]: Start difference. First operand has 1252 states, 617 states have (on average 2.2414910858995136) internal successors, (1383), 1245 states have internal predecessors, (1383), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:37,075 INFO L93 Difference]: Finished difference Result 1820 states and 1944 transitions. [2025-03-09 00:42:37,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:42:37,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-09 00:42:37,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:37,089 INFO L225 Difference]: With dead ends: 1820 [2025-03-09 00:42:37,089 INFO L226 Difference]: Without dead ends: 1817 [2025-03-09 00:42:37,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2025-03-09 00:42:37,091 INFO L435 NwaCegarLoop]: 1033 mSDtfsCounter, 612 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 2891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1945 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:37,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1703 Invalid, 2891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 946 Invalid, 0 Unknown, 1945 Unchecked, 1.7s Time] [2025-03-09 00:42:37,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2025-03-09 00:42:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1240. [2025-03-09 00:42:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 611 states have (on average 2.1243862520458263) internal successors, (1298), 1233 states have internal predecessors, (1298), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:42:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1308 transitions. [2025-03-09 00:42:37,152 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1308 transitions. Word has length 4 [2025-03-09 00:42:37,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:37,152 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1308 transitions. [2025-03-09 00:42:37,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:37,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1308 transitions. [2025-03-09 00:42:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 00:42:37,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:37,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 00:42:37,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 00:42:37,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:37,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr627REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:42:37,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:37,355 INFO L85 PathProgramCache]: Analyzing trace with hash 43773820, now seen corresponding path program 1 times [2025-03-09 00:42:37,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:42:37,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633312750] [2025-03-09 00:42:37,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:37,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:37,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:37,357 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:42:37,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:42:37,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 00:42:37,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 00:42:37,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:37,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:37,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:42:37,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:42:37,467 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 6 treesize of output 7 [2025-03-09 00:42:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:37,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:42:37,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:42:37,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633312750] [2025-03-09 00:42:37,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633312750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:37,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:37,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:42:37,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200791683] [2025-03-09 00:42:37,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:37,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:42:37,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:42:37,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:42:37,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:37,476 INFO L87 Difference]: Start difference. First operand 1240 states and 1308 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:38,620 INFO L93 Difference]: Finished difference Result 1425 states and 1504 transitions. [2025-03-09 00:42:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:42:38,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-09 00:42:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:38,625 INFO L225 Difference]: With dead ends: 1425 [2025-03-09 00:42:38,625 INFO L226 Difference]: Without dead ends: 1425 [2025-03-09 00:42:38,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:38,625 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 1150 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:38,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 909 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 00:42:38,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2025-03-09 00:42:38,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1239. [2025-03-09 00:42:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 620 states have (on average 2.0951612903225807) internal successors, (1299), 1231 states have internal predecessors, (1299), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:42:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1309 transitions. [2025-03-09 00:42:38,647 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1309 transitions. Word has length 4 [2025-03-09 00:42:38,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:38,647 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1309 transitions. [2025-03-09 00:42:38,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1309 transitions. [2025-03-09 00:42:38,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 00:42:38,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:38,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 00:42:38,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 00:42:38,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:38,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr628REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:42:38,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:38,850 INFO L85 PathProgramCache]: Analyzing trace with hash 43773821, now seen corresponding path program 1 times [2025-03-09 00:42:38,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:42:38,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1982137236] [2025-03-09 00:42:38,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:38,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:38,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:38,853 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:42:38,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:42:38,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 00:42:38,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 00:42:38,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:38,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:38,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:42:38,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:42:38,975 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 6 treesize of output 5 [2025-03-09 00:42:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:38,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:42:38,995 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:42:38,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982137236] [2025-03-09 00:42:38,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982137236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:38,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:38,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:42:38,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196137354] [2025-03-09 00:42:38,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:38,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:42:38,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:42:38,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:42:38,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:38,996 INFO L87 Difference]: Start difference. First operand 1239 states and 1309 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:41,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:41,052 INFO L93 Difference]: Finished difference Result 1840 states and 1955 transitions. [2025-03-09 00:42:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:42:41,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-09 00:42:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:41,057 INFO L225 Difference]: With dead ends: 1840 [2025-03-09 00:42:41,058 INFO L226 Difference]: Without dead ends: 1840 [2025-03-09 00:42:41,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:41,060 INFO L435 NwaCegarLoop]: 1012 mSDtfsCounter, 640 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:41,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1696 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-09 00:42:41,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2025-03-09 00:42:41,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1447. [2025-03-09 00:42:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 828 states have (on average 2.077294685990338) internal successors, (1720), 1438 states have internal predecessors, (1720), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:42:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1732 transitions. [2025-03-09 00:42:41,090 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1732 transitions. Word has length 4 [2025-03-09 00:42:41,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:41,090 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1732 transitions. [2025-03-09 00:42:41,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1732 transitions. [2025-03-09 00:42:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 00:42:41,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:41,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:41,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 00:42:41,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:41,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr624REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:42:41,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1851418328, now seen corresponding path program 1 times [2025-03-09 00:42:41,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:42:41,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [204146027] [2025-03-09 00:42:41,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:41,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:41,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:41,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:42:41,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:42:41,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:42:41,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:42:41,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:41,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:41,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 00:42:41,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:42:41,415 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 6 treesize of output 5 [2025-03-09 00:42:41,470 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-03-09 00:42:41,472 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 12 treesize of output 18 [2025-03-09 00:42:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:41,558 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:42:41,558 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:42:41,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204146027] [2025-03-09 00:42:41,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204146027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:41,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:41,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:42:41,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168921603] [2025-03-09 00:42:41,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:41,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:42:41,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:42:41,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:42:41,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:42:41,560 INFO L87 Difference]: Start difference. First operand 1447 states and 1732 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:45,021 INFO L93 Difference]: Finished difference Result 2725 states and 2901 transitions. [2025-03-09 00:42:45,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:42:45,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-03-09 00:42:45,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:45,028 INFO L225 Difference]: With dead ends: 2725 [2025-03-09 00:42:45,028 INFO L226 Difference]: Without dead ends: 2725 [2025-03-09 00:42:45,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:42:45,030 INFO L435 NwaCegarLoop]: 1235 mSDtfsCounter, 1573 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 1943 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:45,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 2600 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1943 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-09 00:42:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2025-03-09 00:42:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 1593. [2025-03-09 00:42:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 974 states have (on average 2.0574948665297743) internal successors, (2004), 1584 states have internal predecessors, (2004), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:42:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2016 transitions. [2025-03-09 00:42:45,059 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2016 transitions. Word has length 8 [2025-03-09 00:42:45,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:45,060 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2016 transitions. [2025-03-09 00:42:45,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2016 transitions. [2025-03-09 00:42:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:42:45,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:45,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:45,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 00:42:45,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:45,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr621REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:42:45,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:45,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1559394628, now seen corresponding path program 1 times [2025-03-09 00:42:45,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:42:45,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [969657540] [2025-03-09 00:42:45,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:45,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:45,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:45,268 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:42:45,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:42:45,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:42:45,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:42:45,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:45,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:45,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:42:45,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:42:45,368 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 6 treesize of output 7 [2025-03-09 00:42:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:45,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:42:45,374 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:42:45,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969657540] [2025-03-09 00:42:45,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969657540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:45,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:45,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:42:45,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970732604] [2025-03-09 00:42:45,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:45,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:42:45,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:42:45,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:42:45,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:45,375 INFO L87 Difference]: Start difference. First operand 1593 states and 2016 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:46,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:46,573 INFO L93 Difference]: Finished difference Result 2133 states and 2784 transitions. [2025-03-09 00:42:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:42:46,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 00:42:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:46,577 INFO L225 Difference]: With dead ends: 2133 [2025-03-09 00:42:46,577 INFO L226 Difference]: Without dead ends: 2133 [2025-03-09 00:42:46,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:46,578 INFO L435 NwaCegarLoop]: 1166 mSDtfsCounter, 935 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:46,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 1519 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-09 00:42:46,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2025-03-09 00:42:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 1545. [2025-03-09 00:42:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 974 states have (on average 1.9969199178644763) internal successors, (1945), 1536 states have internal predecessors, (1945), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:42:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1957 transitions. [2025-03-09 00:42:46,598 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1957 transitions. Word has length 9 [2025-03-09 00:42:46,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:46,598 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1957 transitions. [2025-03-09 00:42:46,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1957 transitions. [2025-03-09 00:42:46,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:42:46,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:46,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:46,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 00:42:46,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:46,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr622REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:42:46,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:46,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1559394629, now seen corresponding path program 1 times [2025-03-09 00:42:46,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:42:46,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1388189275] [2025-03-09 00:42:46,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:46,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:46,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:46,803 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:42:46,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:42:46,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:42:46,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:42:46,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:46,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:46,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:42:46,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:42:46,913 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 6 treesize of output 5 [2025-03-09 00:42:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:46,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:42:46,930 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:42:46,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388189275] [2025-03-09 00:42:46,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388189275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:46,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:46,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:42:46,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146147190] [2025-03-09 00:42:46,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:46,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:42:46,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:42:46,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:42:46,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:46,931 INFO L87 Difference]: Start difference. First operand 1545 states and 1957 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:48,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:48,587 INFO L93 Difference]: Finished difference Result 2232 states and 2883 transitions. [2025-03-09 00:42:48,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:42:48,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 00:42:48,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:48,591 INFO L225 Difference]: With dead ends: 2232 [2025-03-09 00:42:48,592 INFO L226 Difference]: Without dead ends: 2232 [2025-03-09 00:42:48,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:42:48,592 INFO L435 NwaCegarLoop]: 1354 mSDtfsCounter, 698 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:48,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1880 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-09 00:42:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2025-03-09 00:42:48,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 1572. [2025-03-09 00:42:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1011 states have (on average 1.9762611275964392) internal successors, (1998), 1563 states have internal predecessors, (1998), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:42:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2010 transitions. [2025-03-09 00:42:48,613 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2010 transitions. Word has length 9 [2025-03-09 00:42:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:48,613 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2010 transitions. [2025-03-09 00:42:48,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2010 transitions. [2025-03-09 00:42:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 00:42:48,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:48,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:48,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 00:42:48,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:48,814 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:42:48,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:48,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2027684400, now seen corresponding path program 1 times [2025-03-09 00:42:48,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:42:48,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143362877] [2025-03-09 00:42:48,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:48,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:48,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:48,817 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:42:48,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:42:48,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 00:42:48,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 00:42:48,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:48,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:48,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:42:48,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:42:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:48,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:42:48,981 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:42:48,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143362877] [2025-03-09 00:42:48,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143362877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:48,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:48,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:42:48,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000717717] [2025-03-09 00:42:48,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:48,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:42:48,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:42:48,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:42:48,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:42:48,982 INFO L87 Difference]: Start difference. First operand 1572 states and 2010 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:49,516 INFO L93 Difference]: Finished difference Result 2184 states and 2759 transitions. [2025-03-09 00:42:49,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:42:49,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2025-03-09 00:42:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:49,521 INFO L225 Difference]: With dead ends: 2184 [2025-03-09 00:42:49,521 INFO L226 Difference]: Without dead ends: 2184 [2025-03-09 00:42:49,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:42:49,522 INFO L435 NwaCegarLoop]: 1378 mSDtfsCounter, 631 mSDsluCounter, 2387 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 3765 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:49,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 3765 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:42:49,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2025-03-09 00:42:49,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 1825. [2025-03-09 00:42:49,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1262 states have (on average 1.9865293185419968) internal successors, (2507), 1814 states have internal predecessors, (2507), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 00:42:49,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2523 transitions. [2025-03-09 00:42:49,546 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2523 transitions. Word has length 12 [2025-03-09 00:42:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:49,546 INFO L471 AbstractCegarLoop]: Abstraction has 1825 states and 2523 transitions. [2025-03-09 00:42:49,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2523 transitions. [2025-03-09 00:42:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 00:42:49,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:49,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:49,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 00:42:49,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:49,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:42:49,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:49,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1579159040, now seen corresponding path program 1 times [2025-03-09 00:42:49,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:42:49,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1810469338] [2025-03-09 00:42:49,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:49,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:49,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:49,753 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:42:49,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 00:42:49,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 00:42:49,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 00:42:49,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:49,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:49,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:42:49,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:42:49,858 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 6 treesize of output 7 [2025-03-09 00:42:49,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:49,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:42:49,884 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:42:49,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810469338] [2025-03-09 00:42:49,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810469338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:49,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:49,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:42:49,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947987059] [2025-03-09 00:42:49,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:49,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:42:49,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:42:49,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:42:49,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:42:49,885 INFO L87 Difference]: Start difference. First operand 1825 states and 2523 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:51,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:51,451 INFO L93 Difference]: Finished difference Result 2009 states and 2650 transitions. [2025-03-09 00:42:51,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:42:51,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-09 00:42:51,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:51,455 INFO L225 Difference]: With dead ends: 2009 [2025-03-09 00:42:51,455 INFO L226 Difference]: Without dead ends: 2009 [2025-03-09 00:42:51,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:42:51,456 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 1148 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:51,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1457 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-09 00:42:51,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2025-03-09 00:42:51,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1802. [2025-03-09 00:42:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1262 states have (on average 1.9136291600633915) internal successors, (2415), 1791 states have internal predecessors, (2415), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 00:42:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2431 transitions. [2025-03-09 00:42:51,475 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2431 transitions. Word has length 13 [2025-03-09 00:42:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:51,476 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 2431 transitions. [2025-03-09 00:42:51,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2431 transitions. [2025-03-09 00:42:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 00:42:51,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:51,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:51,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 00:42:51,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:51,681 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr298REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:42:51,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:51,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1579159041, now seen corresponding path program 1 times [2025-03-09 00:42:51,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:42:51,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [624099505] [2025-03-09 00:42:51,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:51,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:51,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:51,684 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:42:51,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 00:42:51,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 00:42:51,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 00:42:51,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:51,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:51,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:42:51,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:42:51,803 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 6 treesize of output 5 [2025-03-09 00:42:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:51,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:42:51,853 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:42:51,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624099505] [2025-03-09 00:42:51,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624099505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:51,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:51,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:42:51,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17992371] [2025-03-09 00:42:51,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:51,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:42:51,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:42:51,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:42:51,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:42:51,854 INFO L87 Difference]: Start difference. First operand 1802 states and 2431 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:53,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:53,987 INFO L93 Difference]: Finished difference Result 2131 states and 2582 transitions. [2025-03-09 00:42:53,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:42:53,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-09 00:42:53,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:53,992 INFO L225 Difference]: With dead ends: 2131 [2025-03-09 00:42:53,992 INFO L226 Difference]: Without dead ends: 2131 [2025-03-09 00:42:53,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:42:53,992 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 618 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:53,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 2184 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-09 00:42:53,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2025-03-09 00:42:54,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 1751. [2025-03-09 00:42:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1751 states, 1211 states have (on average 1.9141205615194055) internal successors, (2318), 1740 states have internal predecessors, (2318), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 00:42:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2334 transitions. [2025-03-09 00:42:54,009 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2334 transitions. Word has length 13 [2025-03-09 00:42:54,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:54,010 INFO L471 AbstractCegarLoop]: Abstraction has 1751 states and 2334 transitions. [2025-03-09 00:42:54,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2334 transitions. [2025-03-09 00:42:54,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 00:42:54,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:54,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:54,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 00:42:54,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:54,211 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr274REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:42:54,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:54,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1709245988, now seen corresponding path program 1 times [2025-03-09 00:42:54,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:42:54,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [709278760] [2025-03-09 00:42:54,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:54,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:54,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:54,213 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:42:54,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 00:42:54,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:42:54,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:42:54,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:54,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:54,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:42:54,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:42:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:54,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:42:54,317 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:42:54,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709278760] [2025-03-09 00:42:54,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709278760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:54,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:54,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:42:54,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509342600] [2025-03-09 00:42:54,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:54,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:42:54,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:42:54,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:42:54,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:42:54,320 INFO L87 Difference]: Start difference. First operand 1751 states and 2334 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:54,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:54,359 INFO L93 Difference]: Finished difference Result 1679 states and 2211 transitions. [2025-03-09 00:42:54,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:42:54,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-03-09 00:42:54,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:54,363 INFO L225 Difference]: With dead ends: 1679 [2025-03-09 00:42:54,363 INFO L226 Difference]: Without dead ends: 1679 [2025-03-09 00:42:54,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:42:54,364 INFO L435 NwaCegarLoop]: 1136 mSDtfsCounter, 45 mSDsluCounter, 2249 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3385 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:54,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3385 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:42:54,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2025-03-09 00:42:54,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2025-03-09 00:42:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1158 states have (on average 1.895509499136442) internal successors, (2195), 1668 states have internal predecessors, (2195), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 00:42:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2211 transitions. [2025-03-09 00:42:54,389 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2211 transitions. Word has length 14 [2025-03-09 00:42:54,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:54,389 INFO L471 AbstractCegarLoop]: Abstraction has 1679 states and 2211 transitions. [2025-03-09 00:42:54,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2211 transitions. [2025-03-09 00:42:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 00:42:54,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:54,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:54,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 00:42:54,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:54,591 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:42:54,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:54,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1959746355, now seen corresponding path program 1 times [2025-03-09 00:42:54,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:42:54,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [685786899] [2025-03-09 00:42:54,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:54,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:54,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:54,593 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:42:54,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 00:42:54,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:42:54,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:42:54,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:54,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:54,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:42:54,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:42:54,762 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_49| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_49| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_49|)))) is different from true [2025-03-09 00:42:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:54,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:42:54,763 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:42:54,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685786899] [2025-03-09 00:42:54,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685786899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:54,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:54,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:42:54,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287666088] [2025-03-09 00:42:54,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:54,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:42:54,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:42:54,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:42:54,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2025-03-09 00:42:54,764 INFO L87 Difference]: Start difference. First operand 1679 states and 2211 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:55,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:55,803 INFO L93 Difference]: Finished difference Result 1967 states and 2574 transitions. [2025-03-09 00:42:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:42:55,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2025-03-09 00:42:55,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:55,807 INFO L225 Difference]: With dead ends: 1967 [2025-03-09 00:42:55,807 INFO L226 Difference]: Without dead ends: 1961 [2025-03-09 00:42:55,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2025-03-09 00:42:55,808 INFO L435 NwaCegarLoop]: 1058 mSDtfsCounter, 236 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1407 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:55,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1678 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 642 Invalid, 0 Unknown, 1407 Unchecked, 1.0s Time] [2025-03-09 00:42:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-03-09 00:42:55,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1735. [2025-03-09 00:42:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1213 states have (on average 1.8590272052761747) internal successors, (2255), 1723 states have internal predecessors, (2255), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:42:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2273 transitions. [2025-03-09 00:42:55,823 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2273 transitions. Word has length 15 [2025-03-09 00:42:55,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:55,824 INFO L471 AbstractCegarLoop]: Abstraction has 1735 states and 2273 transitions. [2025-03-09 00:42:55,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2273 transitions. [2025-03-09 00:42:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 00:42:55,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:55,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:55,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 00:42:56,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:56,025 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:42:56,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:56,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1216185876, now seen corresponding path program 1 times [2025-03-09 00:42:56,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:42:56,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1975706169] [2025-03-09 00:42:56,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:56,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:56,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:56,027 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:42:56,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 00:42:56,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:42:56,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:42:56,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:56,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:56,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:42:56,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:42:56,151 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 6 treesize of output 7 [2025-03-09 00:42:56,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:42:56,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:42:56,175 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:42:56,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975706169] [2025-03-09 00:42:56,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975706169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:56,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:56,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:42:56,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725987199] [2025-03-09 00:42:56,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:56,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:42:56,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:42:56,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:42:56,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:42:56,176 INFO L87 Difference]: Start difference. First operand 1735 states and 2273 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:42:57,638 INFO L93 Difference]: Finished difference Result 2166 states and 2812 transitions. [2025-03-09 00:42:57,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:42:57,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-09 00:42:57,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:42:57,645 INFO L225 Difference]: With dead ends: 2166 [2025-03-09 00:42:57,645 INFO L226 Difference]: Without dead ends: 2166 [2025-03-09 00:42:57,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:42:57,646 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 900 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 2029 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:42:57,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 2029 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-09 00:42:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2025-03-09 00:42:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 1712. [2025-03-09 00:42:57,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1213 states have (on average 1.8211046990931574) internal successors, (2209), 1700 states have internal predecessors, (2209), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:42:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2227 transitions. [2025-03-09 00:42:57,660 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2227 transitions. Word has length 18 [2025-03-09 00:42:57,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:42:57,661 INFO L471 AbstractCegarLoop]: Abstraction has 1712 states and 2227 transitions. [2025-03-09 00:42:57,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:42:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2227 transitions. [2025-03-09 00:42:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 00:42:57,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:42:57,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:42:57,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 00:42:57,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:57,863 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:42:57,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:42:57,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1216185875, now seen corresponding path program 1 times [2025-03-09 00:42:57,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:42:57,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328024633] [2025-03-09 00:42:57,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:42:57,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:42:57,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:42:57,865 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:42:57,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 00:42:57,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:42:57,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:42:57,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:42:57,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:42:57,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:42:57,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:42:58,003 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 6 treesize of output 5 [2025-03-09 00:42:58,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-03-09 00:42:58,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:42:58,053 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:42:58,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328024633] [2025-03-09 00:42:58,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328024633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:42:58,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:42:58,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:42:58,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25310808] [2025-03-09 00:42:58,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:42:58,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:42:58,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:42:58,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:42:58,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:42:58,054 INFO L87 Difference]: Start difference. First operand 1712 states and 2227 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:00,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:00,046 INFO L93 Difference]: Finished difference Result 2356 states and 2996 transitions. [2025-03-09 00:43:00,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:43:00,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-09 00:43:00,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:00,051 INFO L225 Difference]: With dead ends: 2356 [2025-03-09 00:43:00,051 INFO L226 Difference]: Without dead ends: 2356 [2025-03-09 00:43:00,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:43:00,051 INFO L435 NwaCegarLoop]: 1293 mSDtfsCounter, 736 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 2591 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:00,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 2591 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-09 00:43:00,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2025-03-09 00:43:00,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1826. [2025-03-09 00:43:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1327 states have (on average 1.7686510926902788) internal successors, (2347), 1814 states have internal predecessors, (2347), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:43:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2365 transitions. [2025-03-09 00:43:00,067 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2365 transitions. Word has length 18 [2025-03-09 00:43:00,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:00,067 INFO L471 AbstractCegarLoop]: Abstraction has 1826 states and 2365 transitions. [2025-03-09 00:43:00,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:00,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2365 transitions. [2025-03-09 00:43:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-09 00:43:00,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:00,068 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:00,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 00:43:00,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:00,269 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:43:00,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:00,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1037999294, now seen corresponding path program 1 times [2025-03-09 00:43:00,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:43:00,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [334599854] [2025-03-09 00:43:00,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:00,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:00,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:00,272 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:00,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 00:43:00,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 00:43:00,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 00:43:00,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:00,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:00,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 00:43:00,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:00,438 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 6 treesize of output 5 [2025-03-09 00:43:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:00,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:43:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:00,880 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:43:00,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334599854] [2025-03-09 00:43:00,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334599854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:43:00,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:43:00,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-09 00:43:00,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122720708] [2025-03-09 00:43:00,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:43:00,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:43:00,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:43:00,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:43:00,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:43:00,881 INFO L87 Difference]: Start difference. First operand 1826 states and 2365 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:06,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:06,627 INFO L93 Difference]: Finished difference Result 2712 states and 3486 transitions. [2025-03-09 00:43:06,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:43:06,630 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 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 37 [2025-03-09 00:43:06,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:06,638 INFO L225 Difference]: With dead ends: 2712 [2025-03-09 00:43:06,638 INFO L226 Difference]: Without dead ends: 2712 [2025-03-09 00:43:06,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:43:06,639 INFO L435 NwaCegarLoop]: 1320 mSDtfsCounter, 2337 mSDsluCounter, 2210 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2339 SdHoareTripleChecker+Valid, 3530 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:06,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2339 Valid, 3530 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-03-09 00:43:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2025-03-09 00:43:06,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 1990. [2025-03-09 00:43:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1491 states have (on average 1.7297116029510395) internal successors, (2579), 1978 states have internal predecessors, (2579), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 00:43:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2597 transitions. [2025-03-09 00:43:06,661 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2597 transitions. Word has length 37 [2025-03-09 00:43:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:06,661 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 2597 transitions. [2025-03-09 00:43:06,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2597 transitions. [2025-03-09 00:43:06,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:43:06,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:06,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:06,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 00:43:06,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:06,867 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:43:06,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:06,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1772843721, now seen corresponding path program 1 times [2025-03-09 00:43:06,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:43:06,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048683521] [2025-03-09 00:43:06,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:06,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:06,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:06,870 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:06,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 00:43:06,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:43:06,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:43:06,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:06,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:06,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:43:06,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:07,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:43:07,034 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:43:07,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048683521] [2025-03-09 00:43:07,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048683521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:07,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:07,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:43:07,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795588453] [2025-03-09 00:43:07,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:07,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:43:07,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:43:07,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:43:07,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:43:07,035 INFO L87 Difference]: Start difference. First operand 1990 states and 2597 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:07,087 INFO L93 Difference]: Finished difference Result 1987 states and 2268 transitions. [2025-03-09 00:43:07,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:43:07,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2025-03-09 00:43:07,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:07,092 INFO L225 Difference]: With dead ends: 1987 [2025-03-09 00:43:07,095 INFO L226 Difference]: Without dead ends: 1987 [2025-03-09 00:43:07,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:43:07,096 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 315 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 2474 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:07,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 2474 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:43:07,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2025-03-09 00:43:07,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1619. [2025-03-09 00:43:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1122 states have (on average 1.6532976827094474) internal successors, (1855), 1609 states have internal predecessors, (1855), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 00:43:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 1869 transitions. [2025-03-09 00:43:07,112 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 1869 transitions. Word has length 47 [2025-03-09 00:43:07,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:07,112 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 1869 transitions. [2025-03-09 00:43:07,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:07,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 1869 transitions. [2025-03-09 00:43:07,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 00:43:07,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:07,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:07,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 00:43:07,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:07,314 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:43:07,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:07,314 INFO L85 PathProgramCache]: Analyzing trace with hash 509105229, now seen corresponding path program 1 times [2025-03-09 00:43:07,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:43:07,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521510331] [2025-03-09 00:43:07,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:07,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:07,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:07,317 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:07,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 00:43:07,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 00:43:07,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 00:43:07,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:07,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:07,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:43:07,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:07,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:43:07,492 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:43:07,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521510331] [2025-03-09 00:43:07,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521510331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:07,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:07,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:43:07,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831338435] [2025-03-09 00:43:07,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:07,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:43:07,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:43:07,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:43:07,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:43:07,493 INFO L87 Difference]: Start difference. First operand 1619 states and 1869 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:07,530 INFO L93 Difference]: Finished difference Result 1601 states and 1839 transitions. [2025-03-09 00:43:07,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:43:07,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 50 [2025-03-09 00:43:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:07,537 INFO L225 Difference]: With dead ends: 1601 [2025-03-09 00:43:07,537 INFO L226 Difference]: Without dead ends: 1601 [2025-03-09 00:43:07,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:43:07,537 INFO L435 NwaCegarLoop]: 1115 mSDtfsCounter, 27 mSDsluCounter, 2193 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3308 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:07,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3308 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:43:07,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2025-03-09 00:43:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2025-03-09 00:43:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1104 states have (on average 1.6530797101449275) internal successors, (1825), 1591 states have internal predecessors, (1825), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 00:43:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 1839 transitions. [2025-03-09 00:43:07,550 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 1839 transitions. Word has length 50 [2025-03-09 00:43:07,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:07,550 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 1839 transitions. [2025-03-09 00:43:07,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:07,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 1839 transitions. [2025-03-09 00:43:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 00:43:07,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:07,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:07,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 00:43:07,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:07,751 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr532REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:43:07,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:07,751 INFO L85 PathProgramCache]: Analyzing trace with hash 492280788, now seen corresponding path program 1 times [2025-03-09 00:43:07,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:43:07,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654066940] [2025-03-09 00:43:07,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:07,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:07,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:07,753 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:07,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 00:43:07,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 00:43:07,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 00:43:07,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:07,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:07,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:43:07,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:07,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:43:07,932 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:43:07,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654066940] [2025-03-09 00:43:07,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654066940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:07,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:07,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:43:07,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137026305] [2025-03-09 00:43:07,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:07,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:43:07,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:43:07,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:43:07,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:43:07,933 INFO L87 Difference]: Start difference. First operand 1601 states and 1839 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:07,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:07,991 INFO L93 Difference]: Finished difference Result 1290 states and 1403 transitions. [2025-03-09 00:43:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:43:07,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2025-03-09 00:43:07,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:07,993 INFO L225 Difference]: With dead ends: 1290 [2025-03-09 00:43:07,993 INFO L226 Difference]: Without dead ends: 1290 [2025-03-09 00:43:07,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:43:07,993 INFO L435 NwaCegarLoop]: 1069 mSDtfsCounter, 56 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:07,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 3134 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:43:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-03-09 00:43:08,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1288. [2025-03-09 00:43:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 814 states have (on average 1.703931203931204) internal successors, (1387), 1278 states have internal predecessors, (1387), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 00:43:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1401 transitions. [2025-03-09 00:43:08,003 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1401 transitions. Word has length 52 [2025-03-09 00:43:08,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:08,003 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1401 transitions. [2025-03-09 00:43:08,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:08,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1401 transitions. [2025-03-09 00:43:08,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 00:43:08,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:08,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:08,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 00:43:08,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:08,204 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:43:08,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:08,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1326202475, now seen corresponding path program 1 times [2025-03-09 00:43:08,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:43:08,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [644236538] [2025-03-09 00:43:08,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:08,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:08,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:08,207 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:08,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 00:43:08,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 00:43:08,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 00:43:08,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:08,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:08,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:43:08,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:08,373 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 00:43:08,374 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 00:43:08,374 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 00:43:08,376 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 30 treesize of output 39 [2025-03-09 00:43:08,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:43:08,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-03-09 00:43:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:08,457 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:43:08,457 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:43:08,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644236538] [2025-03-09 00:43:08,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644236538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:08,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:08,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:43:08,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657941753] [2025-03-09 00:43:08,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:08,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:43:08,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:43:08,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:43:08,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:43:08,459 INFO L87 Difference]: Start difference. First operand 1288 states and 1401 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:08,718 INFO L93 Difference]: Finished difference Result 1955 states and 2115 transitions. [2025-03-09 00:43:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:43:08,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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 58 [2025-03-09 00:43:08,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:08,722 INFO L225 Difference]: With dead ends: 1955 [2025-03-09 00:43:08,722 INFO L226 Difference]: Without dead ends: 1952 [2025-03-09 00:43:08,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:43:08,722 INFO L435 NwaCegarLoop]: 1271 mSDtfsCounter, 1626 mSDsluCounter, 3804 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 5075 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:08,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 5075 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:43:08,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2025-03-09 00:43:08,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1237. [2025-03-09 00:43:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 764 states have (on average 1.7486910994764397) internal successors, (1336), 1228 states have internal predecessors, (1336), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:43:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1348 transitions. [2025-03-09 00:43:08,733 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1348 transitions. Word has length 58 [2025-03-09 00:43:08,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:08,733 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1348 transitions. [2025-03-09 00:43:08,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:08,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1348 transitions. [2025-03-09 00:43:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 00:43:08,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:08,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:08,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-09 00:43:08,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:08,935 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr532REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:43:08,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:08,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1125002868, now seen corresponding path program 1 times [2025-03-09 00:43:08,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:43:08,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1958230193] [2025-03-09 00:43:08,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:08,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:08,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:08,937 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:08,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-09 00:43:09,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 00:43:09,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 00:43:09,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:09,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:09,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 00:43:09,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:09,140 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 6 treesize of output 7 [2025-03-09 00:43:09,144 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 6 treesize of output 5 [2025-03-09 00:43:09,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:43:09,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 00:43:09,459 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 00:43:09,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-09 00:43:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:09,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:43:09,465 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:43:09,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958230193] [2025-03-09 00:43:09,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958230193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:09,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:09,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:43:09,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813317838] [2025-03-09 00:43:09,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:09,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:43:09,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:43:09,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:43:09,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:43:09,466 INFO L87 Difference]: Start difference. First operand 1237 states and 1348 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:10,873 INFO L93 Difference]: Finished difference Result 1567 states and 1705 transitions. [2025-03-09 00:43:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:43:10,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-09 00:43:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:10,875 INFO L225 Difference]: With dead ends: 1567 [2025-03-09 00:43:10,875 INFO L226 Difference]: Without dead ends: 1567 [2025-03-09 00:43:10,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:43:10,876 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 1784 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:10,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1789 Valid, 758 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-09 00:43:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2025-03-09 00:43:10,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1162. [2025-03-09 00:43:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 727 states have (on average 1.6836313617606602) internal successors, (1224), 1153 states have internal predecessors, (1224), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:43:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1236 transitions. [2025-03-09 00:43:10,888 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1236 transitions. Word has length 60 [2025-03-09 00:43:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:10,888 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1236 transitions. [2025-03-09 00:43:10,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1236 transitions. [2025-03-09 00:43:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-09 00:43:10,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:10,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:10,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-09 00:43:11,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:11,089 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr525REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:43:11,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2088993678, now seen corresponding path program 1 times [2025-03-09 00:43:11,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:43:11,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [102058380] [2025-03-09 00:43:11,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:11,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:11,091 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:11,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-09 00:43:11,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 00:43:11,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 00:43:11,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:11,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:11,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:43:11,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:11,267 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 6 treesize of output 7 [2025-03-09 00:43:11,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:43:11,285 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 23 treesize of output 11 [2025-03-09 00:43:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:11,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:43:11,291 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:43:11,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102058380] [2025-03-09 00:43:11,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102058380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:11,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:11,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:43:11,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143935310] [2025-03-09 00:43:11,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:11,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:43:11,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:43:11,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:43:11,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:43:11,292 INFO L87 Difference]: Start difference. First operand 1162 states and 1236 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:12,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:12,665 INFO L93 Difference]: Finished difference Result 1161 states and 1235 transitions. [2025-03-09 00:43:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:43:12,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2025-03-09 00:43:12,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:12,667 INFO L225 Difference]: With dead ends: 1161 [2025-03-09 00:43:12,667 INFO L226 Difference]: Without dead ends: 1161 [2025-03-09 00:43:12,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:43:12,668 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 2 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2689 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:12,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2689 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 00:43:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-03-09 00:43:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2025-03-09 00:43:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 727 states have (on average 1.6822558459422283) internal successors, (1223), 1152 states have internal predecessors, (1223), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:43:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1235 transitions. [2025-03-09 00:43:12,675 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1235 transitions. Word has length 65 [2025-03-09 00:43:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:12,675 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1235 transitions. [2025-03-09 00:43:12,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1235 transitions. [2025-03-09 00:43:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-09 00:43:12,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:12,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:12,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-09 00:43:12,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:12,876 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:43:12,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:12,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2088993677, now seen corresponding path program 1 times [2025-03-09 00:43:12,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:43:12,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1162269602] [2025-03-09 00:43:12,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:12,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:12,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:12,879 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:12,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-09 00:43:13,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 00:43:13,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 00:43:13,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:13,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:13,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 00:43:13,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:13,077 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 6 treesize of output 5 [2025-03-09 00:43:13,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 00:43:13,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:43:13,114 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 21 treesize of output 9 [2025-03-09 00:43:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:13,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:43:13,129 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:43:13,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162269602] [2025-03-09 00:43:13,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162269602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:13,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:13,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:43:13,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375694666] [2025-03-09 00:43:13,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:13,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:43:13,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:43:13,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:43:13,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:43:13,130 INFO L87 Difference]: Start difference. First operand 1161 states and 1235 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:14,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:14,912 INFO L93 Difference]: Finished difference Result 1160 states and 1234 transitions. [2025-03-09 00:43:14,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:43:14,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2025-03-09 00:43:14,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:14,914 INFO L225 Difference]: With dead ends: 1160 [2025-03-09 00:43:14,914 INFO L226 Difference]: Without dead ends: 1160 [2025-03-09 00:43:14,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:43:14,914 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 1 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:14,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2695 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-09 00:43:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2025-03-09 00:43:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1160. [2025-03-09 00:43:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 726 states have (on average 1.6831955922865014) internal successors, (1222), 1151 states have internal predecessors, (1222), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:43:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1234 transitions. [2025-03-09 00:43:14,921 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1234 transitions. Word has length 65 [2025-03-09 00:43:14,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:14,921 INFO L471 AbstractCegarLoop]: Abstraction has 1160 states and 1234 transitions. [2025-03-09 00:43:14,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:43:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1234 transitions. [2025-03-09 00:43:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-09 00:43:14,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:14,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:14,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-09 00:43:15,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:15,122 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:43:15,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:15,123 INFO L85 PathProgramCache]: Analyzing trace with hash -443358256, now seen corresponding path program 1 times [2025-03-09 00:43:15,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:43:15,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538771921] [2025-03-09 00:43:15,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:15,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:15,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:15,125 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:15,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-09 00:43:15,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 00:43:15,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 00:43:15,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:15,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:15,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:43:15,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:15,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:15,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:43:15,343 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:43:15,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538771921] [2025-03-09 00:43:15,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538771921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:43:15,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:43:15,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:43:15,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141699509] [2025-03-09 00:43:15,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:43:15,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:43:15,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:43:15,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:43:15,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:43:15,344 INFO L87 Difference]: Start difference. First operand 1160 states and 1234 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:43:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:15,372 INFO L93 Difference]: Finished difference Result 1163 states and 1238 transitions. [2025-03-09 00:43:15,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:43:15,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2025-03-09 00:43:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:15,377 INFO L225 Difference]: With dead ends: 1163 [2025-03-09 00:43:15,377 INFO L226 Difference]: Without dead ends: 1163 [2025-03-09 00:43:15,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:43:15,379 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 0 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3118 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:15,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3118 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:43:15,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2025-03-09 00:43:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1163. [2025-03-09 00:43:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 728 states have (on average 1.6826923076923077) internal successors, (1225), 1154 states have internal predecessors, (1225), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-09 00:43:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1238 transitions. [2025-03-09 00:43:15,388 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1238 transitions. Word has length 73 [2025-03-09 00:43:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:15,388 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1238 transitions. [2025-03-09 00:43:15,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:43:15,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1238 transitions. [2025-03-09 00:43:15,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-09 00:43:15,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:15,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:15,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-09 00:43:15,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:15,590 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:43:15,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:15,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1170161748, now seen corresponding path program 1 times [2025-03-09 00:43:15,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:43:15,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [390250763] [2025-03-09 00:43:15,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:43:15,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:15,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:15,593 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:15,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-09 00:43:15,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 00:43:15,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 00:43:15,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:43:15,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:43:15,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:43:15,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:43:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:15,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:43:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:43:15,859 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:43:15,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390250763] [2025-03-09 00:43:15,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390250763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:43:15,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:43:15,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-09 00:43:15,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448641698] [2025-03-09 00:43:15,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:43:15,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:43:15,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:43:15,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:43:15,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:43:15,859 INFO L87 Difference]: Start difference. First operand 1163 states and 1238 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:43:15,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:43:15,965 INFO L93 Difference]: Finished difference Result 1175 states and 1255 transitions. [2025-03-09 00:43:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:43:15,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2025-03-09 00:43:15,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:43:15,968 INFO L225 Difference]: With dead ends: 1175 [2025-03-09 00:43:15,968 INFO L226 Difference]: Without dead ends: 1175 [2025-03-09 00:43:15,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:43:15,968 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 8 mSDsluCounter, 3116 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4157 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:43:15,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4157 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:43:15,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-03-09 00:43:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1173. [2025-03-09 00:43:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 737 states have (on average 1.682496607869742) internal successors, (1240), 1163 states have internal predecessors, (1240), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-09 00:43:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1253 transitions. [2025-03-09 00:43:15,982 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1253 transitions. Word has length 74 [2025-03-09 00:43:15,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:43:15,983 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1253 transitions. [2025-03-09 00:43:15,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:43:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1253 transitions. [2025-03-09 00:43:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-09 00:43:15,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:43:15,983 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:43:15,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-09 00:43:16,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:16,184 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2025-03-09 00:43:16,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:43:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1140333360, now seen corresponding path program 2 times [2025-03-09 00:43:16,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:43:16,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [79657700] [2025-03-09 00:43:16,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:43:16,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:43:16,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:43:16,187 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:43:16,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-09 00:43:16,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-09 00:44:01,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 00:44:01,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:44:01,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:44:01,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 00:44:01,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:44:01,808 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 6 treesize of output 7 [2025-03-09 00:44:01,881 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 00:44:01,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-09 00:44:01,885 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 6 treesize of output 5 [2025-03-09 00:44:01,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 00:44:01,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 00:44:01,964 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 22 treesize of output 10 [2025-03-09 00:44:01,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-09 00:44:02,061 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-09 00:44:02,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-09 00:44:02,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-09 00:44:02,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-09 00:44:02,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-09 00:44:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 00:44:02,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:44:02,215 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_1270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2025-03-09 00:44:02,219 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:44:02,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79657700] [2025-03-09 00:44:02,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79657700] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:44:02,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1406031318] [2025-03-09 00:44:02,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:44:02,219 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-09 00:44:02,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-09 00:44:02,241 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-09 00:44:02,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2025-03-09 00:44:02,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-09 00:44:03,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 00:44:03,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:44:03,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:44:03,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 00:44:03,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:44:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:44:03,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:44:03,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:44:03,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1406031318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:44:03,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:44:03,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-09 00:44:03,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688127886] [2025-03-09 00:44:03,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:44:03,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 00:44:03,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:44:03,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 00:44:03,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=423, Unknown=1, NotChecked=42, Total=552 [2025-03-09 00:44:03,425 INFO L87 Difference]: Start difference. First operand 1173 states and 1253 transitions. Second operand has 21 states, 20 states have (on average 7.5) internal successors, (150), 21 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)