./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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_test5-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 ad1bbae792ec9c8e2e546dc04f3672720af98ce14b9bd37d0d7647e79ce45565 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:31:47,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:31:47,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:31:47,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:31:47,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:31:47,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:31:47,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:31:47,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:31:47,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:31:47,513 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:31:47,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:31:47,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:31:47,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:31:47,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:31:47,514 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:31:47,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:31:47,515 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:31:47,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:31:47,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:31:47,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:31:47,515 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:31:47,516 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:31:47,516 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:31:47,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:31:47,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:31:47,516 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:31:47,516 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:31:47,516 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:31:47,516 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:31:47,516 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:31:47,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:31:47,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:31:47,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:31:47,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:31:47,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:31:47,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:31:47,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:31:47,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:31:47,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:31:47,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:31:47,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:31:47,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:31:47,517 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 -> ad1bbae792ec9c8e2e546dc04f3672720af98ce14b9bd37d0d7647e79ce45565 [2025-03-04 09:31:47,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:31:47,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:31:47,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:31:47,747 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:31:47,747 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:31:47,749 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_test5-2.i [2025-03-04 09:31:48,835 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3a1c1ee3/43476f5e784d430599daeab01cc720dd/FLAG1e244309a [2025-03-04 09:31:49,106 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:31:49,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i [2025-03-04 09:31:49,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3a1c1ee3/43476f5e784d430599daeab01cc720dd/FLAG1e244309a [2025-03-04 09:31:49,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3a1c1ee3/43476f5e784d430599daeab01cc720dd [2025-03-04 09:31:49,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:31:49,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:31:49,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:31:49,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:31:49,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:31:49,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:31:49" (1/1) ... [2025-03-04 09:31:49,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286da023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:49, skipping insertion in model container [2025-03-04 09:31:49,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:31:49" (1/1) ... [2025-03-04 09:31:49,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:31:49,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-04 09:31:49,429 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-04 09:31:49,433 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-04 09:31:49,436 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-04 09:31:49,440 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-04 09:31:49,463 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-04 09:31:49,464 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-04 09:31:49,466 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-04 09:31:49,469 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-04 09:31:49,486 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-04 09:31:49,486 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-04 09:31:49,488 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-04 09:31:49,488 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-04 09:31:49,490 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-04 09:31:49,491 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-04 09:31:49,492 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-04 09:31:49,493 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-04 09:31:49,494 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-04 09:31:49,496 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-04 09:31:49,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:31:49,520 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-04 09:31:49,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@afcfbc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:49, skipping insertion in model container [2025-03-04 09:31:49,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:31:49,521 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-04 09:31:49,523 INFO L158 Benchmark]: Toolchain (without parser) took 392.74ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 82.1MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 09:31:49,523 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:31:49,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.18ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 82.1MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 09:31:49,524 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.39ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.18ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 82.1MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 757]: 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_test5-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 ad1bbae792ec9c8e2e546dc04f3672720af98ce14b9bd37d0d7647e79ce45565 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:31:51,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:31:51,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 09:31:51,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:31:51,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:31:51,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:31:51,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:31:51,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:31:51,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:31:51,255 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:31:51,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:31:51,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:31:51,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:31:51,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:31:51,256 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:31:51,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:31:51,256 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:31:51,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:31:51,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:31:51,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:31:51,257 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:31:51,257 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:31:51,257 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:31:51,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:31:51,257 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:31:51,257 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 09:31:51,258 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 09:31:51,258 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:31:51,258 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:31:51,258 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:31:51,258 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:31:51,258 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:31:51,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:31:51,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:31:51,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:31:51,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:31:51,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:31:51,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:31:51,259 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 09:31:51,259 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 09:31:51,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:31:51,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:31:51,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:31:51,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:31:51,260 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 -> ad1bbae792ec9c8e2e546dc04f3672720af98ce14b9bd37d0d7647e79ce45565 [2025-03-04 09:31:51,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:31:51,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:31:51,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:31:51,513 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:31:51,514 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:31:51,514 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_test5-2.i [2025-03-04 09:31:52,712 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23f927f67/31140849347c494e930e71cde8de07e3/FLAGb65e6cd06 [2025-03-04 09:31:53,015 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:31:53,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i [2025-03-04 09:31:53,028 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23f927f67/31140849347c494e930e71cde8de07e3/FLAGb65e6cd06 [2025-03-04 09:31:53,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23f927f67/31140849347c494e930e71cde8de07e3 [2025-03-04 09:31:53,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:31:53,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:31:53,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:31:53,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:31:53,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:31:53,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:31:53" (1/1) ... [2025-03-04 09:31:53,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c1bbfe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:53, skipping insertion in model container [2025-03-04 09:31:53,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:31:53" (1/1) ... [2025-03-04 09:31:53,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:31:53,316 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-04 09:31:53,341 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-04 09:31:53,344 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-04 09:31:53,348 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-04 09:31:53,354 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-04 09:31:53,379 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-04 09:31:53,381 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-04 09:31:53,383 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-04 09:31:53,386 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-04 09:31:53,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-04 09:31:53,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-04 09:31:53,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-04 09:31:53,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-04 09:31:53,407 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-04 09:31:53,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-04 09:31:53,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-04 09:31:53,410 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-04 09:31:53,410 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-04 09:31:53,412 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-04 09:31:53,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:31:53,425 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-04 09:31:53,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:31:53,473 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-04 09:31:53,485 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-04 09:31:53,492 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-04 09:31:53,494 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-04 09:31:53,498 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-04 09:31:53,520 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-04 09:31:53,522 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-04 09:31:53,524 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-04 09:31:53,527 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-04 09:31:53,542 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-04 09:31:53,542 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-04 09:31:53,544 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-04 09:31:53,545 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-04 09:31:53,546 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-04 09:31:53,548 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-04 09:31:53,549 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-04 09:31:53,549 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-04 09:31:53,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-04 09:31:53,551 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-04 09:31:53,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:31:53,572 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:31:53,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:31:53,667 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:31:53,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:53 WrapperNode [2025-03-04 09:31:53,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:31:53,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:31:53,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:31:53,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:31:53,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:53" (1/1) ... [2025-03-04 09:31:53,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:53" (1/1) ... [2025-03-04 09:31:53,753 INFO L138 Inliner]: procedures = 180, calls = 426, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1543 [2025-03-04 09:31:53,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:31:53,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:31:53,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:31:53,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:31:53,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:53" (1/1) ... [2025-03-04 09:31:53,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:53" (1/1) ... [2025-03-04 09:31:53,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:53" (1/1) ... [2025-03-04 09:31:53,883 INFO L175 MemorySlicer]: Split 397 memory accesses to 3 slices as follows [2, 371, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 91 writes are split as follows [0, 90, 1]. [2025-03-04 09:31:53,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:53" (1/1) ... [2025-03-04 09:31:53,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:53" (1/1) ... [2025-03-04 09:31:53,918 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:53" (1/1) ... [2025-03-04 09:31:53,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:53" (1/1) ... [2025-03-04 09:31:53,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:53" (1/1) ... [2025-03-04 09:31:53,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:53" (1/1) ... [2025-03-04 09:31:53,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:31:53,940 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:31:53,940 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:31:53,941 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:31:53,941 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:53" (1/1) ... [2025-03-04 09:31:53,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:31:53,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:31:53,980 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-04 09:31:53,982 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-04 09:31:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 09:31:54,000 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 09:31:54,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 09:31:54,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 09:31:54,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 09:31:54,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 09:31:54,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 09:31:54,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 09:31:54,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 09:31:54,002 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 09:31:54,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 09:31:54,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 09:31:54,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 09:31:54,002 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 09:31:54,002 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 09:31:54,002 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 09:31:54,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:31:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:31:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 09:31:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 09:31:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 09:31:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:31:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 09:31:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 09:31:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 09:31:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:31:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 09:31:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 09:31:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 09:31:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 09:31:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 09:31:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 09:31:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:31:54,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:31:54,210 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:31:54,211 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:31:57,669 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2025-03-04 09:31:57,806 INFO L? ?]: Removed 1703 outVars from TransFormulas that were not future-live. [2025-03-04 09:31:57,807 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:31:57,841 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:31:57,842 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:31:57,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:31:57 BoogieIcfgContainer [2025-03-04 09:31:57,845 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:31:57,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:31:57,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:31:57,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:31:57,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:31:53" (1/3) ... [2025-03-04 09:31:57,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f19795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:31:57, skipping insertion in model container [2025-03-04 09:31:57,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:31:53" (2/3) ... [2025-03-04 09:31:57,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f19795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:31:57, skipping insertion in model container [2025-03-04 09:31:57,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:31:57" (3/3) ... [2025-03-04 09:31:57,854 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test5-2.i [2025-03-04 09:31:57,864 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:31:57,865 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test5-2.i that has 6 procedures, 1642 locations, 1 initial locations, 51 loop locations, and 817 error locations. [2025-03-04 09:31:57,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:31:57,928 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;@2915c27f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:31:57,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 817 error locations. [2025-03-04 09:31:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 1632 states, 804 states have (on average 2.228855721393035) internal successors, (1792), 1622 states have internal predecessors, (1792), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 09:31:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 09:31:57,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:57,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:31:57,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr814REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:31:57,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1768295323, now seen corresponding path program 1 times [2025-03-04 09:31:57,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:31:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355947213] [2025-03-04 09:31:57,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:57,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:31:57,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:31:57,955 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-04 09:31:57,957 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-04 09:31:58,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:31:58,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:31:58,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:58,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:58,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 09:31:58,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:31:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:31:58,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:31:58,102 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:31:58,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355947213] [2025-03-04 09:31:58,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355947213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:31:58,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:31:58,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:31:58,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106704319] [2025-03-04 09:31:58,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:31:58,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:31:58,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:31:58,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:31:58,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:31:58,126 INFO L87 Difference]: Start difference. First operand has 1632 states, 804 states have (on average 2.228855721393035) internal successors, (1792), 1622 states have internal predecessors, (1792), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-04 09:31:58,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:31:58,197 INFO L93 Difference]: Finished difference Result 1612 states and 1705 transitions. [2025-03-04 09:31:58,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:31:58,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-03-04 09:31:58,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:31:58,219 INFO L225 Difference]: With dead ends: 1612 [2025-03-04 09:31:58,219 INFO L226 Difference]: Without dead ends: 1610 [2025-03-04 09:31:58,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:31:58,223 INFO L435 NwaCegarLoop]: 1705 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:31:58,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:31:58,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2025-03-04 09:31:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1610. [2025-03-04 09:31:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 794 states have (on average 2.1146095717884132) internal successors, (1679), 1600 states have internal predecessors, (1679), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 09:31:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1703 transitions. [2025-03-04 09:31:58,322 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1703 transitions. Word has length 5 [2025-03-04 09:31:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:31:58,322 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 1703 transitions. [2025-03-04 09:31:58,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-04 09:31:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1703 transitions. [2025-03-04 09:31:58,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 09:31:58,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:31:58,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:31:58,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 09:31:58,523 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-04 09:31:58,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr814REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:31:58,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:31:58,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1768295354, now seen corresponding path program 1 times [2025-03-04 09:31:58,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:31:58,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025668012] [2025-03-04 09:31:58,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:31:58,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:31:58,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:31:58,528 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-04 09:31:58,529 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-04 09:31:58,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:31:58,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:31:58,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:31:58,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:31:58,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:31:58,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:31:58,662 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-04 09:31:58,674 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-04 09:31:58,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:31:58,674 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:31:58,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025668012] [2025-03-04 09:31:58,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025668012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:31:58,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:31:58,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:31:58,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460970481] [2025-03-04 09:31:58,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:31:58,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:31:58,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:31:58,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:31:58,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:31:58,676 INFO L87 Difference]: Start difference. First operand 1610 states and 1703 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-04 09:32:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:00,579 INFO L93 Difference]: Finished difference Result 1742 states and 1867 transitions. [2025-03-04 09:32:00,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:32:00,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-04 09:32:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:00,583 INFO L225 Difference]: With dead ends: 1742 [2025-03-04 09:32:00,584 INFO L226 Difference]: Without dead ends: 1742 [2025-03-04 09:32:00,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04 09:32:00,584 INFO L435 NwaCegarLoop]: 1165 mSDtfsCounter, 1254 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:00,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 1443 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 09:32:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2025-03-04 09:32:00,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1518. [2025-03-04 09:32:00,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 794 states have (on average 1.9987405541561714) internal successors, (1587), 1508 states have internal predecessors, (1587), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 09:32:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1611 transitions. [2025-03-04 09:32:00,617 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1611 transitions. Word has length 5 [2025-03-04 09:32:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:00,617 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1611 transitions. [2025-03-04 09:32:00,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-04 09:32:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1611 transitions. [2025-03-04 09:32:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 09:32:00,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:00,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:32:00,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:32:00,822 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-04 09:32:00,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr815REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:00,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:00,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1768295355, now seen corresponding path program 1 times [2025-03-04 09:32:00,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:00,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269109939] [2025-03-04 09:32:00,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:00,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:00,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:00,824 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-04 09:32:00,825 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-04 09:32:00,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:32:00,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:32:00,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:00,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:00,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:32:00,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:00,940 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-04 09:32:00,957 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-04 09:32:00,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:00,957 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:00,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269109939] [2025-03-04 09:32:00,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269109939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:00,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:00,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:32:00,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272234447] [2025-03-04 09:32:00,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:00,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:32:00,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:00,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:32:00,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:32:00,959 INFO L87 Difference]: Start difference. First operand 1518 states and 1611 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-04 09:32:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:03,389 INFO L93 Difference]: Finished difference Result 2058 states and 2202 transitions. [2025-03-04 09:32:03,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:32:03,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-04 09:32:03,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:03,394 INFO L225 Difference]: With dead ends: 2058 [2025-03-04 09:32:03,394 INFO L226 Difference]: Without dead ends: 2058 [2025-03-04 09:32:03,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04 09:32:03,395 INFO L435 NwaCegarLoop]: 1527 mSDtfsCounter, 760 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 2229 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:03,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 2229 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-04 09:32:03,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2025-03-04 09:32:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1683. [2025-03-04 09:32:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 969 states have (on average 1.9659442724458205) internal successors, (1905), 1673 states have internal predecessors, (1905), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 09:32:03,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 1929 transitions. [2025-03-04 09:32:03,424 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 1929 transitions. Word has length 5 [2025-03-04 09:32:03,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:03,424 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 1929 transitions. [2025-03-04 09:32:03,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-04 09:32:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 1929 transitions. [2025-03-04 09:32:03,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 09:32:03,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:03,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:32:03,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 09:32:03,625 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-04 09:32:03,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr194REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:03,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:03,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1767008427, now seen corresponding path program 1 times [2025-03-04 09:32:03,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:03,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012056810] [2025-03-04 09:32:03,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:03,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:03,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:03,628 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-04 09:32:03,629 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-04 09:32:03,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:32:03,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:32:03,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:03,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:03,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:32:03,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:03,732 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-04 09:32:03,744 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-04 09:32:03,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:03,744 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:03,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012056810] [2025-03-04 09:32:03,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012056810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:03,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:03,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:32:03,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006029470] [2025-03-04 09:32:03,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:03,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:32:03,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:03,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:32:03,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:32:03,748 INFO L87 Difference]: Start difference. First operand 1683 states and 1929 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-04 09:32:05,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:05,845 INFO L93 Difference]: Finished difference Result 2986 states and 3446 transitions. [2025-03-04 09:32:05,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:32:05,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-04 09:32:05,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:05,852 INFO L225 Difference]: With dead ends: 2986 [2025-03-04 09:32:05,852 INFO L226 Difference]: Without dead ends: 2986 [2025-03-04 09:32:05,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04 09:32:05,853 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 1399 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1410 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:05,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1410 Valid, 1685 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 09:32:05,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2025-03-04 09:32:05,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2204. [2025-03-04 09:32:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2204 states, 1491 states have (on average 1.9356136820925554) internal successors, (2886), 2190 states have internal predecessors, (2886), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:32:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 2918 transitions. [2025-03-04 09:32:05,888 INFO L78 Accepts]: Start accepts. Automaton has 2204 states and 2918 transitions. Word has length 5 [2025-03-04 09:32:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:05,888 INFO L471 AbstractCegarLoop]: Abstraction has 2204 states and 2918 transitions. [2025-03-04 09:32:05,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-04 09:32:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 2918 transitions. [2025-03-04 09:32:05,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 09:32:05,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:05,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:32:05,895 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-04 09:32:06,089 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-04 09:32:06,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr195REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:06,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:06,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1767008428, now seen corresponding path program 1 times [2025-03-04 09:32:06,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:06,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1131380194] [2025-03-04 09:32:06,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:06,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:06,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:06,092 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-04 09:32:06,093 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-04 09:32:06,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:32:06,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:32:06,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:06,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:06,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 09:32:06,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:06,197 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-04 09:32:06,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:06,197 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:06,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131380194] [2025-03-04 09:32:06,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131380194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:06,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:06,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:32:06,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804984020] [2025-03-04 09:32:06,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:06,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:32:06,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:06,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:32:06,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:32:06,198 INFO L87 Difference]: Start difference. First operand 2204 states and 2918 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-04 09:32:06,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:06,286 INFO L93 Difference]: Finished difference Result 3849 states and 4957 transitions. [2025-03-04 09:32:06,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:32:06,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-04 09:32:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:06,303 INFO L225 Difference]: With dead ends: 3849 [2025-03-04 09:32:06,303 INFO L226 Difference]: Without dead ends: 3849 [2025-03-04 09:32:06,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04 09:32:06,306 INFO L435 NwaCegarLoop]: 1863 mSDtfsCounter, 1348 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 3453 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:06,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 3453 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:32:06,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2025-03-04 09:32:06,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 2206. [2025-03-04 09:32:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2206 states, 1493 states have (on average 1.9336905559276625) internal successors, (2887), 2192 states have internal predecessors, (2887), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:32:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 2919 transitions. [2025-03-04 09:32:06,354 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 2919 transitions. Word has length 5 [2025-03-04 09:32:06,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:06,354 INFO L471 AbstractCegarLoop]: Abstraction has 2206 states and 2919 transitions. [2025-03-04 09:32:06,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-04 09:32:06,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2919 transitions. [2025-03-04 09:32:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 09:32:06,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:06,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:32:06,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:32:06,555 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-04 09:32:06,555 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr810REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:06,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:06,555 INFO L85 PathProgramCache]: Analyzing trace with hash -294095497, now seen corresponding path program 1 times [2025-03-04 09:32:06,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:06,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [116497702] [2025-03-04 09:32:06,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:06,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:06,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:06,558 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-04 09:32:06,559 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-04 09:32:06,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:32:06,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:32:06,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:06,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:06,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:32:06,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:06,681 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-04 09:32:06,703 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-04 09:32:06,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:06,703 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:06,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116497702] [2025-03-04 09:32:06,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116497702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:06,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:06,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:32:06,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179831211] [2025-03-04 09:32:06,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:06,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:32:06,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:06,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:32:06,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:06,704 INFO L87 Difference]: Start difference. First operand 2206 states and 2919 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-04 09:32:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:08,678 INFO L93 Difference]: Finished difference Result 2191 states and 2881 transitions. [2025-03-04 09:32:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:32:08,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-03-04 09:32:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:08,684 INFO L225 Difference]: With dead ends: 2191 [2025-03-04 09:32:08,684 INFO L226 Difference]: Without dead ends: 2191 [2025-03-04 09:32:08,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-04 09:32:08,685 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 1304 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:08,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 1705 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 09:32:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2025-03-04 09:32:08,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2183. [2025-03-04 09:32:08,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 1493 states have (on average 1.9028801071667782) internal successors, (2841), 2169 states have internal predecessors, (2841), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:32:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 2873 transitions. [2025-03-04 09:32:08,715 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 2873 transitions. Word has length 10 [2025-03-04 09:32:08,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:08,715 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 2873 transitions. [2025-03-04 09:32:08,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-04 09:32:08,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2873 transitions. [2025-03-04 09:32:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 09:32:08,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:08,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:32:08,723 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-04 09:32:08,916 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-04 09:32:08,917 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr811REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:08,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:08,917 INFO L85 PathProgramCache]: Analyzing trace with hash -294095496, now seen corresponding path program 1 times [2025-03-04 09:32:08,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:08,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [827357823] [2025-03-04 09:32:08,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:08,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:08,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:08,919 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-04 09:32:08,921 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-04 09:32:09,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:32:09,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:32:09,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:09,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:09,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 09:32:09,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:09,063 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-04 09:32:09,115 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-04 09:32:09,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:09,116 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:09,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827357823] [2025-03-04 09:32:09,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827357823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:09,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:09,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:32:09,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168818661] [2025-03-04 09:32:09,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:09,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:32:09,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:09,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:32:09,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:09,116 INFO L87 Difference]: Start difference. First operand 2183 states and 2873 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-04 09:32:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:11,984 INFO L93 Difference]: Finished difference Result 2700 states and 3314 transitions. [2025-03-04 09:32:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:32:11,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-03-04 09:32:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:11,990 INFO L225 Difference]: With dead ends: 2700 [2025-03-04 09:32:11,990 INFO L226 Difference]: Without dead ends: 2700 [2025-03-04 09:32:11,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-04 09:32:11,991 INFO L435 NwaCegarLoop]: 1250 mSDtfsCounter, 883 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 2723 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:11,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 2723 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-04 09:32:11,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2025-03-04 09:32:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2297. [2025-03-04 09:32:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2297 states, 1607 states have (on average 1.8537647790914749) internal successors, (2979), 2283 states have internal predecessors, (2979), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:32:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 3011 transitions. [2025-03-04 09:32:12,025 INFO L78 Accepts]: Start accepts. Automaton has 2297 states and 3011 transitions. Word has length 10 [2025-03-04 09:32:12,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:12,025 INFO L471 AbstractCegarLoop]: Abstraction has 2297 states and 3011 transitions. [2025-03-04 09:32:12,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-04 09:32:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 3011 transitions. [2025-03-04 09:32:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 09:32:12,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:12,027 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] [2025-03-04 09:32:12,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 09:32:12,227 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-04 09:32:12,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr811REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:12,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1971768254, now seen corresponding path program 1 times [2025-03-04 09:32:12,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:12,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [142052326] [2025-03-04 09:32:12,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:12,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:12,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:12,230 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-04 09:32:12,231 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-04 09:32:12,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 09:32:12,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 09:32:12,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:12,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:12,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 09:32:12,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:12,390 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-04 09:32:12,548 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-04 09:32:12,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:32:12,822 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-04 09:32:12,822 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:12,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142052326] [2025-03-04 09:32:12,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142052326] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:32:12,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:32:12,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 09:32:12,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343366349] [2025-03-04 09:32:12,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:32:12,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:32:12,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:12,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:32:12,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:32:12,823 INFO L87 Difference]: Start difference. First operand 2297 states and 3011 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:21,089 INFO L93 Difference]: Finished difference Result 3108 states and 3884 transitions. [2025-03-04 09:32:21,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:32:21,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-04 09:32:21,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:21,099 INFO L225 Difference]: With dead ends: 3108 [2025-03-04 09:32:21,099 INFO L226 Difference]: Without dead ends: 3108 [2025-03-04 09:32:21,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 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-04 09:32:21,100 INFO L435 NwaCegarLoop]: 1251 mSDtfsCounter, 1432 mSDsluCounter, 4468 mSDsCounter, 0 mSdLazyCounter, 5063 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 5719 SdHoareTripleChecker+Invalid, 5091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 5063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:21,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 5719 Invalid, 5091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 5063 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2025-03-04 09:32:21,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2025-03-04 09:32:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 2461. [2025-03-04 09:32:21,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2461 states, 1771 states have (on average 1.8130999435347261) internal successors, (3211), 2447 states have internal predecessors, (3211), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:32:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 3243 transitions. [2025-03-04 09:32:21,132 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 3243 transitions. Word has length 29 [2025-03-04 09:32:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:21,133 INFO L471 AbstractCegarLoop]: Abstraction has 2461 states and 3243 transitions. [2025-03-04 09:32:21,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3243 transitions. [2025-03-04 09:32:21,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 09:32:21,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:21,135 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] [2025-03-04 09:32:21,145 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-04 09:32:21,335 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-04 09:32:21,336 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr758REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:21,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:21,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1991701978, now seen corresponding path program 1 times [2025-03-04 09:32:21,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:21,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [475004291] [2025-03-04 09:32:21,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:21,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:21,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:21,339 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-04 09:32:21,341 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-04 09:32:21,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 09:32:21,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 09:32:21,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:21,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:21,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:32:21,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:21,632 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-04 09:32:21,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:21,633 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:21,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475004291] [2025-03-04 09:32:21,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475004291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:21,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:21,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:32:21,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652274290] [2025-03-04 09:32:21,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:21,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:32:21,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:21,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:32:21,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:32:21,634 INFO L87 Difference]: Start difference. First operand 2461 states and 3243 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-04 09:32:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:21,742 INFO L93 Difference]: Finished difference Result 2869 states and 3738 transitions. [2025-03-04 09:32:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:32:21,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2025-03-04 09:32:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:21,754 INFO L225 Difference]: With dead ends: 2869 [2025-03-04 09:32:21,754 INFO L226 Difference]: Without dead ends: 2869 [2025-03-04 09:32:21,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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-04 09:32:21,755 INFO L435 NwaCegarLoop]: 1648 mSDtfsCounter, 251 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 3159 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:21,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 3159 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:32:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2025-03-04 09:32:21,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 2677. [2025-03-04 09:32:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 1987 states have (on average 1.7654755913437343) internal successors, (3508), 2663 states have internal predecessors, (3508), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:32:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3540 transitions. [2025-03-04 09:32:21,777 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3540 transitions. Word has length 41 [2025-03-04 09:32:21,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:21,778 INFO L471 AbstractCegarLoop]: Abstraction has 2677 states and 3540 transitions. [2025-03-04 09:32:21,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-04 09:32:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3540 transitions. [2025-03-04 09:32:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:32:21,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:21,779 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] [2025-03-04 09:32:21,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 09:32:21,979 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-04 09:32:21,979 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr729REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:21,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:21,980 INFO L85 PathProgramCache]: Analyzing trace with hash -180290689, now seen corresponding path program 1 times [2025-03-04 09:32:21,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:21,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2071647396] [2025-03-04 09:32:21,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:21,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:21,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:21,982 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-04 09:32:21,982 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-04 09:32:22,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:32:22,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:32:22,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:22,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:22,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:32:22,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:22,161 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-04 09:32:22,161 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:22,161 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:22,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071647396] [2025-03-04 09:32:22,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071647396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:22,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:22,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:32:22,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515672574] [2025-03-04 09:32:22,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:22,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:32:22,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:22,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:32:22,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:22,162 INFO L87 Difference]: Start difference. First operand 2677 states and 3540 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-04 09:32:22,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:22,229 INFO L93 Difference]: Finished difference Result 2222 states and 2886 transitions. [2025-03-04 09:32:22,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:32:22,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2025-03-04 09:32:22,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:22,238 INFO L225 Difference]: With dead ends: 2222 [2025-03-04 09:32:22,238 INFO L226 Difference]: Without dead ends: 2222 [2025-03-04 09:32:22,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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-04 09:32:22,239 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 56 mSDsluCounter, 2959 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4475 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-04 09:32:22,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4475 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:32:22,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2025-03-04 09:32:22,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2219. [2025-03-04 09:32:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2219 states, 1552 states have (on average 1.8369845360824741) internal successors, (2851), 2205 states have internal predecessors, (2851), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:32:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 2883 transitions. [2025-03-04 09:32:22,263 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 2883 transitions. Word has length 44 [2025-03-04 09:32:22,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:22,265 INFO L471 AbstractCegarLoop]: Abstraction has 2219 states and 2883 transitions. [2025-03-04 09:32:22,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-04 09:32:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 2883 transitions. [2025-03-04 09:32:22,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 09:32:22,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:22,268 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-04 09:32:22,283 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-04 09:32:22,469 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-04 09:32:22,469 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr729REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:22,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:22,470 INFO L85 PathProgramCache]: Analyzing trace with hash -746919497, now seen corresponding path program 1 times [2025-03-04 09:32:22,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:22,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1945187540] [2025-03-04 09:32:22,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:22,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:22,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:22,472 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-04 09:32:22,473 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-04 09:32:22,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 09:32:22,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 09:32:22,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:22,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:22,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 09:32:22,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:22,664 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-04 09:32:22,668 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-04 09:32:22,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:32:22,974 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-04 09:32:22,986 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 09:32:22,986 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-04 09:32:22,998 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-04 09:32:22,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:22,998 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:22,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945187540] [2025-03-04 09:32:22,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945187540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:22,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:22,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:32:22,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998369198] [2025-03-04 09:32:22,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:22,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:32:22,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:22,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:32:22,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:23,000 INFO L87 Difference]: Start difference. First operand 2219 states and 2883 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) 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-04 09:32:24,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:24,620 INFO L93 Difference]: Finished difference Result 2135 states and 2763 transitions. [2025-03-04 09:32:24,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:32:24,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) 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-04 09:32:24,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:24,625 INFO L225 Difference]: With dead ends: 2135 [2025-03-04 09:32:24,625 INFO L226 Difference]: Without dead ends: 2135 [2025-03-04 09:32:24,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 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-04 09:32:24,625 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 2280 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2291 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:24,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2291 Valid, 757 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 09:32:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2025-03-04 09:32:24,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1789. [2025-03-04 09:32:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1206 states have (on average 1.7238805970149254) internal successors, (2079), 1775 states have internal predecessors, (2079), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:32:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2111 transitions. [2025-03-04 09:32:24,642 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2111 transitions. Word has length 52 [2025-03-04 09:32:24,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:24,642 INFO L471 AbstractCegarLoop]: Abstraction has 1789 states and 2111 transitions. [2025-03-04 09:32:24,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) 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-04 09:32:24,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2111 transitions. [2025-03-04 09:32:24,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 09:32:24,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:24,643 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] [2025-03-04 09:32:24,654 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-04 09:32:24,843 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-04 09:32:24,844 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr722REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:24,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1914980142, now seen corresponding path program 1 times [2025-03-04 09:32:24,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:24,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1199520933] [2025-03-04 09:32:24,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:24,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:24,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:24,848 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-04 09:32:24,849 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-04 09:32:24,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 09:32:25,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 09:32:25,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:25,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:25,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:32:25,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:25,050 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-04 09:32:25,061 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-04 09:32:25,078 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-04 09:32:25,084 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-04 09:32:25,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:25,084 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:25,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199520933] [2025-03-04 09:32:25,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199520933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:25,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:25,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:32:25,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558488349] [2025-03-04 09:32:25,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:25,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:32:25,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:25,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:32:25,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:32:25,085 INFO L87 Difference]: Start difference. First operand 1789 states and 2111 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:27,005 INFO L93 Difference]: Finished difference Result 1788 states and 2109 transitions. [2025-03-04 09:32:27,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:32:27,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-04 09:32:27,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:27,008 INFO L225 Difference]: With dead ends: 1788 [2025-03-04 09:32:27,008 INFO L226 Difference]: Without dead ends: 1788 [2025-03-04 09:32:27,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 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-04 09:32:27,009 INFO L435 NwaCegarLoop]: 1442 mSDtfsCounter, 2 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3723 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:27,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3723 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2052 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 09:32:27,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2025-03-04 09:32:27,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1788. [2025-03-04 09:32:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1206 states have (on average 1.7222222222222223) internal successors, (2077), 1774 states have internal predecessors, (2077), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:32:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2109 transitions. [2025-03-04 09:32:27,023 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2109 transitions. Word has length 57 [2025-03-04 09:32:27,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:27,023 INFO L471 AbstractCegarLoop]: Abstraction has 1788 states and 2109 transitions. [2025-03-04 09:32:27,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:27,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2109 transitions. [2025-03-04 09:32:27,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 09:32:27,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:27,024 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] [2025-03-04 09:32:27,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 09:32:27,224 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-04 09:32:27,224 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr723REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:27,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:27,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1914980143, now seen corresponding path program 1 times [2025-03-04 09:32:27,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:27,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1720517528] [2025-03-04 09:32:27,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:27,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:27,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:27,227 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-04 09:32:27,229 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-04 09:32:27,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 09:32:27,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 09:32:27,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:27,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:27,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 09:32:27,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:27,419 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-04 09:32:27,433 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-04 09:32:27,440 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-04 09:32:27,470 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-04 09:32:27,482 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-04 09:32:27,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:27,482 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:27,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720517528] [2025-03-04 09:32:27,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720517528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:27,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:27,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:32:27,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228930533] [2025-03-04 09:32:27,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:27,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:32:27,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:27,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:32:27,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:32:27,483 INFO L87 Difference]: Start difference. First operand 1788 states and 2109 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:29,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:29,987 INFO L93 Difference]: Finished difference Result 1787 states and 2107 transitions. [2025-03-04 09:32:29,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:32:29,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-04 09:32:29,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:29,990 INFO L225 Difference]: With dead ends: 1787 [2025-03-04 09:32:29,990 INFO L226 Difference]: Without dead ends: 1787 [2025-03-04 09:32:29,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 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-04 09:32:29,991 INFO L435 NwaCegarLoop]: 1442 mSDtfsCounter, 1 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3757 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:29,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3757 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2015 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-04 09:32:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2025-03-04 09:32:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1787. [2025-03-04 09:32:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1204 states have (on average 1.723421926910299) internal successors, (2075), 1773 states have internal predecessors, (2075), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 09:32:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2107 transitions. [2025-03-04 09:32:30,004 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2107 transitions. Word has length 57 [2025-03-04 09:32:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:30,005 INFO L471 AbstractCegarLoop]: Abstraction has 1787 states and 2107 transitions. [2025-03-04 09:32:30,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2107 transitions. [2025-03-04 09:32:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 09:32:30,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:30,006 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-04 09:32:30,014 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-04 09:32:30,206 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-04 09:32:30,206 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr718REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:30,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:30,207 INFO L85 PathProgramCache]: Analyzing trace with hash 483866187, now seen corresponding path program 1 times [2025-03-04 09:32:30,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:30,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8166419] [2025-03-04 09:32:30,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:30,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:30,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:30,210 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-04 09:32:30,211 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-04 09:32:30,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 09:32:30,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 09:32:30,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:30,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:30,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 09:32:30,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:30,408 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-04 09:32:30,454 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-04 09:32:30,464 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-04 09:32:30,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:30,464 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:30,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8166419] [2025-03-04 09:32:30,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8166419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:30,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:30,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:32:30,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733201739] [2025-03-04 09:32:30,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:30,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:32:30,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:30,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:32:30,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:32:30,466 INFO L87 Difference]: Start difference. First operand 1787 states and 2107 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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-04 09:32:32,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:32,844 INFO L93 Difference]: Finished difference Result 1805 states and 2138 transitions. [2025-03-04 09:32:32,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:32:32,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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 65 [2025-03-04 09:32:32,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:32,848 INFO L225 Difference]: With dead ends: 1805 [2025-03-04 09:32:32,848 INFO L226 Difference]: Without dead ends: 1805 [2025-03-04 09:32:32,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:32:32,848 INFO L435 NwaCegarLoop]: 1424 mSDtfsCounter, 13 mSDsluCounter, 3803 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5227 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:32,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5227 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-04 09:32:32,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2025-03-04 09:32:32,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1796. [2025-03-04 09:32:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1212 states have (on average 1.721122112211221) internal successors, (2086), 1780 states have internal predecessors, (2086), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (25), 13 states have call predecessors, (25), 15 states have call successors, (25) [2025-03-04 09:32:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2128 transitions. [2025-03-04 09:32:32,863 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2128 transitions. Word has length 65 [2025-03-04 09:32:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:32,863 INFO L471 AbstractCegarLoop]: Abstraction has 1796 states and 2128 transitions. [2025-03-04 09:32:32,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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-04 09:32:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2128 transitions. [2025-03-04 09:32:32,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 09:32:32,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:32,864 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-04 09:32:32,874 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-04 09:32:33,064 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-04 09:32:33,065 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr719REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:33,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:33,065 INFO L85 PathProgramCache]: Analyzing trace with hash 483866188, now seen corresponding path program 1 times [2025-03-04 09:32:33,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:33,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723274823] [2025-03-04 09:32:33,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:33,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:33,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:33,068 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-04 09:32:33,069 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-04 09:32:33,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 09:32:33,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 09:32:33,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:33,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:33,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:32:33,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:33,271 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-04 09:32:33,271 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:33,271 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:33,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723274823] [2025-03-04 09:32:33,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723274823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:33,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:33,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:32:33,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095887441] [2025-03-04 09:32:33,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:33,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:32:33,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:33,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:32:33,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:33,272 INFO L87 Difference]: Start difference. First operand 1796 states and 2128 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-04 09:32:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:33,315 INFO L93 Difference]: Finished difference Result 1790 states and 2112 transitions. [2025-03-04 09:32:33,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:32:33,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 65 [2025-03-04 09:32:33,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:33,318 INFO L225 Difference]: With dead ends: 1790 [2025-03-04 09:32:33,318 INFO L226 Difference]: Without dead ends: 1790 [2025-03-04 09:32:33,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 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-04 09:32:33,321 INFO L435 NwaCegarLoop]: 1441 mSDtfsCounter, 0 mSDsluCounter, 2874 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4315 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:33,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4315 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:32:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2025-03-04 09:32:33,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1790. [2025-03-04 09:32:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1206 states have (on average 1.7230514096185738) internal successors, (2078), 1776 states have internal predecessors, (2078), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2025-03-04 09:32:33,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2112 transitions. [2025-03-04 09:32:33,342 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2112 transitions. Word has length 65 [2025-03-04 09:32:33,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:33,342 INFO L471 AbstractCegarLoop]: Abstraction has 1790 states and 2112 transitions. [2025-03-04 09:32:33,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-04 09:32:33,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2112 transitions. [2025-03-04 09:32:33,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 09:32:33,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:33,343 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] [2025-03-04 09:32:33,354 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-04 09:32:33,544 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-04 09:32:33,544 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr718REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:33,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash -553723336, now seen corresponding path program 1 times [2025-03-04 09:32:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:33,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [234966161] [2025-03-04 09:32:33,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:33,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:33,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:33,547 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-04 09:32:33,548 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-04 09:32:33,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 09:32:33,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 09:32:33,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:33,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:33,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:32:33,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:33,755 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-04 09:32:33,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:32:33,805 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-04 09:32:33,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:33,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234966161] [2025-03-04 09:32:33,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234966161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:32:33,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:32:33,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 09:32:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903294043] [2025-03-04 09:32:33,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:32:33,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:32:33,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:33,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:32:33,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:32:33,806 INFO L87 Difference]: Start difference. First operand 1790 states and 2112 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-04 09:32:33,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:33,937 INFO L93 Difference]: Finished difference Result 1802 states and 2130 transitions. [2025-03-04 09:32:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:32:33,937 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 66 [2025-03-04 09:32:33,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:33,940 INFO L225 Difference]: With dead ends: 1802 [2025-03-04 09:32:33,940 INFO L226 Difference]: Without dead ends: 1802 [2025-03-04 09:32:33,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 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-04 09:32:33,941 INFO L435 NwaCegarLoop]: 1440 mSDtfsCounter, 8 mSDsluCounter, 4308 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5748 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:33,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5748 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:32:33,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2025-03-04 09:32:33,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1800. [2025-03-04 09:32:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1215 states have (on average 1.722633744855967) internal successors, (2093), 1785 states have internal predecessors, (2093), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2025-03-04 09:32:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2127 transitions. [2025-03-04 09:32:33,958 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2127 transitions. Word has length 66 [2025-03-04 09:32:33,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:33,959 INFO L471 AbstractCegarLoop]: Abstraction has 1800 states and 2127 transitions. [2025-03-04 09:32:33,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-04 09:32:33,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2127 transitions. [2025-03-04 09:32:33,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 09:32:33,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:33,959 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] [2025-03-04 09:32:33,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 09:32:34,159 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-04 09:32:34,160 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr718REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:34,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:34,160 INFO L85 PathProgramCache]: Analyzing trace with hash 999770507, now seen corresponding path program 2 times [2025-03-04 09:32:34,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:34,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [442901684] [2025-03-04 09:32:34,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:32:34,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:34,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:34,162 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-04 09:32:34,163 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-04 09:32:34,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-04 09:32:38,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 09:32:38,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:32:38,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:38,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 09:32:38,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:38,837 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-04 09:32:38,899 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 09:32:38,899 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-04 09:32:38,913 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-04 09:32:39,033 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:32:39,033 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 44 treesize of output 43 [2025-03-04 09:32:39,059 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 33 treesize of output 15 [2025-03-04 09:32:39,071 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-04 09:32:39,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:32:39,118 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2025-03-04 09:32:39,119 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 25 treesize of output 24 [2025-03-04 09:32:39,126 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2025-03-04 09:32:39,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:39,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442901684] [2025-03-04 09:32:39,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442901684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:32:39,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1075626606] [2025-03-04 09:32:39,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:32:39,131 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 09:32:39,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 09:32:39,133 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 09:32:39,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2025-03-04 09:32:39,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-04 09:32:39,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 09:32:39,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:32:39,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:39,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:32:39,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:40,056 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-04 09:32:40,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:32:40,223 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-04 09:32:40,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1075626606] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:32:40,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:32:40,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-03-04 09:32:40,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003775254] [2025-03-04 09:32:40,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:32:40,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 09:32:40,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:40,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 09:32:40,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=467, Unknown=1, NotChecked=44, Total=600 [2025-03-04 09:32:40,225 INFO L87 Difference]: Start difference. First operand 1800 states and 2127 transitions. Second operand has 23 states, 22 states have (on average 6.2272727272727275) internal successors, (137), 22 states have internal predecessors, (137), 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) [2025-03-04 09:32:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:46,881 INFO L93 Difference]: Finished difference Result 1816 states and 2151 transitions. [2025-03-04 09:32:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 09:32:46,881 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.2272727272727275) internal successors, (137), 22 states have internal predecessors, (137), 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) Word has length 69 [2025-03-04 09:32:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:46,884 INFO L225 Difference]: With dead ends: 1816 [2025-03-04 09:32:46,884 INFO L226 Difference]: Without dead ends: 1812 [2025-03-04 09:32:46,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=407, Invalid=2046, Unknown=1, NotChecked=96, Total=2550 [2025-03-04 09:32:46,885 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 1163 mSDsluCounter, 9090 mSDsCounter, 0 mSdLazyCounter, 7847 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 9949 SdHoareTripleChecker+Invalid, 7902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 7847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:46,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 9949 Invalid, 7902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 7847 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-03-04 09:32:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2025-03-04 09:32:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1808. [2025-03-04 09:32:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1224 states have (on average 1.7181372549019607) internal successors, (2103), 1793 states have internal predecessors, (2103), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2025-03-04 09:32:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2137 transitions. [2025-03-04 09:32:46,898 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2137 transitions. Word has length 69 [2025-03-04 09:32:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:46,898 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2137 transitions. [2025-03-04 09:32:46,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.2272727272727275) internal successors, (137), 22 states have internal predecessors, (137), 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) [2025-03-04 09:32:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2137 transitions. [2025-03-04 09:32:46,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 09:32:46,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:46,899 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 09:32:46,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2025-03-04 09:32:47,118 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-04 09:32:47,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:47,300 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr719REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:47,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:47,300 INFO L85 PathProgramCache]: Analyzing trace with hash 797481580, now seen corresponding path program 1 times [2025-03-04 09:32:47,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:47,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1747213042] [2025-03-04 09:32:47,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:47,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:47,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:47,302 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-04 09:32:47,303 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-04 09:32:47,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 09:32:47,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 09:32:47,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:47,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:47,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 09:32:47,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:47,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:32:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:47,964 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:47,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747213042] [2025-03-04 09:32:47,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747213042] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:32:47,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:32:47,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2025-03-04 09:32:47,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784652455] [2025-03-04 09:32:47,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:32:47,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 09:32:47,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:47,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 09:32:47,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2025-03-04 09:32:47,965 INFO L87 Difference]: Start difference. First operand 1808 states and 2137 transitions. Second operand has 26 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 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-04 09:32:49,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:49,026 INFO L93 Difference]: Finished difference Result 1832 states and 2176 transitions. [2025-03-04 09:32:49,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 09:32:49,027 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 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 75 [2025-03-04 09:32:49,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:49,030 INFO L225 Difference]: With dead ends: 1832 [2025-03-04 09:32:49,030 INFO L226 Difference]: Without dead ends: 1826 [2025-03-04 09:32:49,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 09:32:49,031 INFO L435 NwaCegarLoop]: 1440 mSDtfsCounter, 15 mSDsluCounter, 15795 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 17235 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:49,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 17235 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:32:49,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2025-03-04 09:32:49,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1826. [2025-03-04 09:32:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1242 states have (on average 1.711755233494364) internal successors, (2126), 1811 states have internal predecessors, (2126), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2025-03-04 09:32:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2160 transitions. [2025-03-04 09:32:49,055 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2160 transitions. Word has length 75 [2025-03-04 09:32:49,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:49,055 INFO L471 AbstractCegarLoop]: Abstraction has 1826 states and 2160 transitions. [2025-03-04 09:32:49,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 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-04 09:32:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2160 transitions. [2025-03-04 09:32:49,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 09:32:49,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:49,056 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 09:32:49,067 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-04 09:32:49,256 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-04 09:32:49,256 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr719REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2025-03-04 09:32:49,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:49,257 INFO L85 PathProgramCache]: Analyzing trace with hash 500220972, now seen corresponding path program 2 times [2025-03-04 09:32:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:49,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914657275] [2025-03-04 09:32:49,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:32:49,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:49,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:49,259 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-04 09:32:49,260 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-04 09:32:49,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-04 09:32:55,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 09:32:55,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:32:55,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:55,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 09:32:55,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:55,196 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-04 09:32:55,204 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 09:32:55,204 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-04 09:32:55,220 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-04 09:32:55,224 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-04 09:32:55,279 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-04 09:32:55,289 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-04 09:32:55,579 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:32:55,580 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-04 09:32:55,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:32:55,612 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-04 09:32:55,615 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-04 09:32:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 09:32:55,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:32:55,905 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_1540 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1541 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1540) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1540 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1540) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2025-03-04 09:32:55,910 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:55,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914657275] [2025-03-04 09:32:55,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914657275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:32:55,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2120959897] [2025-03-04 09:32:55,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:32:55,910 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 09:32:55,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 09:32:55,912 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 09:32:55,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2025-03-04 09:32:56,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-04 09:32:56,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 09:32:56,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:32:56,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:56,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 09:32:56,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:57,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:32:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:59,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2120959897] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:32:59,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:32:59,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 26, 26] total 57 [2025-03-04 09:32:59,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222937977] [2025-03-04 09:32:59,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:32:59,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-04 09:32:59,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:59,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-04 09:32:59,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=2728, Unknown=1, NotChecked=114, Total=3540 [2025-03-04 09:32:59,031 INFO L87 Difference]: Start difference. First operand 1826 states and 2160 transitions. Second operand has 57 states, 56 states have (on average 3.0535714285714284) internal successors, (171), 57 states have internal predecessors, (171), 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)