./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:40:41,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:40:41,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 07:40:41,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:40:41,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:40:41,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:40:41,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:40:41,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:40:41,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:40:41,986 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:40:41,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:40:41,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:40:41,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:40:41,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:40:41,987 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:40:41,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:40:41,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:40:41,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:40:41,988 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:40:41,988 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:40:41,988 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:40:41,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:40:41,988 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:40:41,988 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:40:41,988 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:40:41,989 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:40:41,989 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:40:41,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:40:41,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:40:41,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:40:41,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:40:41,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:40:41,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:40:41,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:40:41,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:40:41,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:40:41,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:40:41,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:40:41,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:40:41,990 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 [2025-02-08 07:40:42,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:40:42,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:40:42,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:40:42,201 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:40:42,201 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:40:42,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2025-02-08 07:40:43,333 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed0355b2b/53a8026421d545fbbed9ebfa97a01a18/FLAG30435da54 [2025-02-08 07:40:43,593 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:40:43,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2025-02-08 07:40:43,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed0355b2b/53a8026421d545fbbed9ebfa97a01a18/FLAG30435da54 [2025-02-08 07:40:43,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed0355b2b/53a8026421d545fbbed9ebfa97a01a18 [2025-02-08 07:40:43,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:40:43,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:40:43,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:40:43,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:40:43,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:40:43,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:40:43" (1/1) ... [2025-02-08 07:40:43,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ff858a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:43, skipping insertion in model container [2025-02-08 07:40:43,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:40:43" (1/1) ... [2025-02-08 07:40:43,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:40:44,350 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:44,360 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:44,362 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:44,365 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:44,367 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:44,373 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:44,374 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:44,374 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:44,375 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:44,380 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:44,388 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:44,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:40:44,418 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:40:44,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:40:44,555 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:40:44,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:44 WrapperNode [2025-02-08 07:40:44,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:40:44,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:40:44,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:40:44,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:40:44,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:44" (1/1) ... [2025-02-08 07:40:44,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:44" (1/1) ... [2025-02-08 07:40:44,611 INFO L138 Inliner]: procedures = 346, calls = 461, calls flagged for inlining = 12, calls inlined = 11, statements flattened = 726 [2025-02-08 07:40:44,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:40:44,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:40:44,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:40:44,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:40:44,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:44" (1/1) ... [2025-02-08 07:40:44,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:44" (1/1) ... [2025-02-08 07:40:44,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:44" (1/1) ... [2025-02-08 07:40:44,669 INFO L175 MemorySlicer]: Split 410 memory accesses to 14 slices as follows [2, 12, 3, 3, 3, 4, 12, 4, 4, 3, 1, 355, 2, 2]. 87 percent of accesses are in the largest equivalence class. The 378 initializations are split as follows [2, 0, 3, 3, 3, 3, 0, 3, 3, 3, 0, 355, 0, 0]. The 10 writes are split as follows [0, 2, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 2, 1]. [2025-02-08 07:40:44,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:44" (1/1) ... [2025-02-08 07:40:44,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:44" (1/1) ... [2025-02-08 07:40:44,689 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:44" (1/1) ... [2025-02-08 07:40:44,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:44" (1/1) ... [2025-02-08 07:40:44,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:44" (1/1) ... [2025-02-08 07:40:44,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:44" (1/1) ... [2025-02-08 07:40:44,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:40:44,714 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:40:44,714 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:40:44,714 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:40:44,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:44" (1/1) ... [2025-02-08 07:40:44,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:40:44,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:44,738 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 07:40:44,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 07:40:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 07:40:44,760 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 07:40:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 07:40:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 07:40:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 07:40:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 07:40:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 07:40:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 07:40:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 07:40:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 07:40:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 07:40:44,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 07:40:44,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 07:40:44,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 07:40:44,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 07:40:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 07:40:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:40:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 07:40:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 07:40:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 07:40:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 07:40:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 07:40:44,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 07:40:44,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-08 07:40:44,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:40:44,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:40:45,056 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:40:45,058 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:40:45,671 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1505: safe_write_~tmp_if_expr$1~1#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem72#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 07:40:45,671 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1505-1: SUMMARY for call safe_write_#t~mem72#1 := read~int#10(~bb_errno~0.base, ~bb_errno~0.offset, 4); srcloc: null [2025-02-08 07:40:45,672 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1505-1: assume !(1 == #valid[~bb_errno~0.base]); [2025-02-08 07:40:45,672 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1505-1: assume !(4 + ~bb_errno~0.offset <= #length[~bb_errno~0.base] && 0 <= ~bb_errno~0.offset); [2025-02-08 07:40:45,672 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1468: full_write_#t~ret67#1 := safe_write_#res#1;havoc safe_write_#t~ret71#1, safe_write_#t~mem72#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~1#1, safe_write_~tmp_if_expr$1~1#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret67#1 && full_write_#t~ret67#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret67#1;havoc full_write_#t~ret67#1; [2025-02-08 07:40:45,672 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501-1: assume 0 != safe_write_~tmp_if_expr$1~1#1 % 256; [2025-02-08 07:40:45,672 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501-1: assume !(0 != safe_write_~tmp_if_expr$1~1#1 % 256); [2025-02-08 07:40:45,672 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1469: assume full_write_~cc~0#1 < 0; [2025-02-08 07:40:45,673 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1469: assume !(full_write_~cc~0#1 < 0);full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 07:40:45,673 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1503: safe_write_#t~ret71#1 := write_#res#1;havoc write_#t~nondet104#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret71#1 && safe_write_#t~ret71#1 <= 9223372036854775807;safe_write_~n~1#1 := safe_write_#t~ret71#1;havoc safe_write_#t~ret71#1; [2025-02-08 07:40:45,673 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1504: assume safe_write_~n~1#1 < 0; [2025-02-08 07:40:45,673 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1504: assume !(safe_write_~n~1#1 < 0);safe_write_~tmp_if_expr$1~1#1 := 0; [2025-02-08 07:40:45,673 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1471: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:40:45,673 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1471: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 07:40:45,709 INFO L? ?]: Removed 253 outVars from TransFormulas that were not future-live. [2025-02-08 07:40:45,709 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:40:45,723 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:40:45,723 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 07:40:45,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:40:45 BoogieIcfgContainer [2025-02-08 07:40:45,724 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:40:45,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:40:45,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:40:45,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:40:45,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:40:43" (1/3) ... [2025-02-08 07:40:45,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a22803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:40:45, skipping insertion in model container [2025-02-08 07:40:45,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:44" (2/3) ... [2025-02-08 07:40:45,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a22803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:40:45, skipping insertion in model container [2025-02-08 07:40:45,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:40:45" (3/3) ... [2025-02-08 07:40:45,733 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-1.i [2025-02-08 07:40:45,745 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:40:45,746 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG basename-1.i that has 2 procedures, 229 locations, 1 initial locations, 7 loop locations, and 94 error locations. [2025-02-08 07:40:45,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:40:45,792 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;@6859073d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:40:45,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2025-02-08 07:40:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 229 states, 128 states have (on average 1.984375) internal successors, (254), 225 states have internal predecessors, (254), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:40:45,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:40:45,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:45,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:40:45,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:45,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:45,805 INFO L85 PathProgramCache]: Analyzing trace with hash 10079, now seen corresponding path program 1 times [2025-02-08 07:40:45,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:45,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997478757] [2025-02-08 07:40:45,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:45,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:45,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:40:46,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:40:46,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:46,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:46,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:46,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997478757] [2025-02-08 07:40:46,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997478757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:46,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:46,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:40:46,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336919509] [2025-02-08 07:40:46,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:46,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:46,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:46,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:46,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:46,378 INFO L87 Difference]: Start difference. First operand has 229 states, 128 states have (on average 1.984375) internal successors, (254), 225 states have internal predecessors, (254), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:46,519 INFO L93 Difference]: Finished difference Result 186 states and 203 transitions. [2025-02-08 07:40:46,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:46,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:40:46,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:46,525 INFO L225 Difference]: With dead ends: 186 [2025-02-08 07:40:46,525 INFO L226 Difference]: Without dead ends: 175 [2025-02-08 07:40:46,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:46,528 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 156 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:46,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 143 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:46,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-02-08 07:40:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 159. [2025-02-08 07:40:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 90 states have (on average 1.9111111111111112) internal successors, (172), 156 states have internal predecessors, (172), 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-02-08 07:40:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 174 transitions. [2025-02-08 07:40:46,565 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 174 transitions. Word has length 2 [2025-02-08 07:40:46,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:46,565 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 174 transitions. [2025-02-08 07:40:46,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 174 transitions. [2025-02-08 07:40:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:40:46,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:46,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:40:46,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:40:46,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:46,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:46,566 INFO L85 PathProgramCache]: Analyzing trace with hash 10080, now seen corresponding path program 1 times [2025-02-08 07:40:46,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:46,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313189956] [2025-02-08 07:40:46,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:46,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:46,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:40:46,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:40:46,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:46,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:46,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:46,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313189956] [2025-02-08 07:40:46,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313189956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:46,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:46,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:40:46,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028677389] [2025-02-08 07:40:46,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:46,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:46,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:46,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:46,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:46,806 INFO L87 Difference]: Start difference. First operand 159 states and 174 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:46,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:46,911 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2025-02-08 07:40:46,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:46,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:40:46,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:46,913 INFO L225 Difference]: With dead ends: 158 [2025-02-08 07:40:46,913 INFO L226 Difference]: Without dead ends: 158 [2025-02-08 07:40:46,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:46,913 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:46,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 270 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:46,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-08 07:40:46,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-02-08 07:40:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 90 states have (on average 1.9) internal successors, (171), 155 states have internal predecessors, (171), 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-02-08 07:40:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2025-02-08 07:40:46,926 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 2 [2025-02-08 07:40:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:46,926 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2025-02-08 07:40:46,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2025-02-08 07:40:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:40:46,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:46,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:40:46,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:40:46,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:46,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:46,928 INFO L85 PathProgramCache]: Analyzing trace with hash 300512698, now seen corresponding path program 1 times [2025-02-08 07:40:46,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:46,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328765797] [2025-02-08 07:40:46,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:46,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:46,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:40:46,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:40:46,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:46,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:47,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:47,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328765797] [2025-02-08 07:40:47,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328765797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:47,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:47,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:40:47,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639382483] [2025-02-08 07:40:47,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:47,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:40:47,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:47,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:40:47,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:40:47,239 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand has 4 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-02-08 07:40:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:47,379 INFO L93 Difference]: Finished difference Result 161 states and 176 transitions. [2025-02-08 07:40:47,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:40:47,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-02-08 07:40:47,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:47,380 INFO L225 Difference]: With dead ends: 161 [2025-02-08 07:40:47,380 INFO L226 Difference]: Without dead ends: 161 [2025-02-08 07:40:47,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-02-08 07:40:47,381 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 6 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:47,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 370 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-08 07:40:47,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2025-02-08 07:40:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 157 states have internal predecessors, (173), 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-02-08 07:40:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 175 transitions. [2025-02-08 07:40:47,387 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 175 transitions. Word has length 5 [2025-02-08 07:40:47,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:47,387 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 175 transitions. [2025-02-08 07:40:47,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-02-08 07:40:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 175 transitions. [2025-02-08 07:40:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:40:47,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:47,387 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:47,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:40:47,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:47,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1862155867, now seen corresponding path program 1 times [2025-02-08 07:40:47,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:47,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925972382] [2025-02-08 07:40:47,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:47,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:47,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:40:47,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:40:47,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:47,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:47,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:47,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925972382] [2025-02-08 07:40:47,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925972382] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:47,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562836839] [2025-02-08 07:40:47,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:47,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:47,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:47,647 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:47,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 07:40:47,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:40:47,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:40:47,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:47,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:47,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 07:40:47,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:47,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:40:48,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-08 07:40:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:48,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562836839] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:40:48,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:40:48,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-02-08 07:40:48,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574320433] [2025-02-08 07:40:48,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:40:48,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:40:48,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:48,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:40:48,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:40:48,056 INFO L87 Difference]: Start difference. First operand 160 states and 175 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:48,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:48,380 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2025-02-08 07:40:48,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:40:48,380 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 07:40:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:48,381 INFO L225 Difference]: With dead ends: 163 [2025-02-08 07:40:48,381 INFO L226 Difference]: Without dead ends: 163 [2025-02-08 07:40:48,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2025-02-08 07:40:48,383 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 483 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:48,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 777 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 07:40:48,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-08 07:40:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2025-02-08 07:40:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 157 states have internal predecessors, (173), 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-02-08 07:40:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 175 transitions. [2025-02-08 07:40:48,394 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 175 transitions. Word has length 8 [2025-02-08 07:40:48,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:48,395 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 175 transitions. [2025-02-08 07:40:48,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:48,395 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 175 transitions. [2025-02-08 07:40:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 07:40:48,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:48,395 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:48,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 07:40:48,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:48,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:48,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1908482918, now seen corresponding path program 1 times [2025-02-08 07:40:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:48,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094964275] [2025-02-08 07:40:48,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:48,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:48,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 07:40:48,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 07:40:48,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:48,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:48,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:48,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094964275] [2025-02-08 07:40:48,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094964275] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:48,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603576408] [2025-02-08 07:40:48,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:48,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:48,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:48,779 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:48,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 07:40:48,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 07:40:48,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 07:40:48,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:48,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:48,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 07:40:48,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:49,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:40:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:49,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603576408] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:40:49,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:40:49,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-08 07:40:49,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849556076] [2025-02-08 07:40:49,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:40:49,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 07:40:49,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:49,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 07:40:49,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:40:49,056 INFO L87 Difference]: Start difference. First operand 160 states and 175 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:40:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:49,102 INFO L93 Difference]: Finished difference Result 172 states and 187 transitions. [2025-02-08 07:40:49,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:40:49,103 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2025-02-08 07:40:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:49,103 INFO L225 Difference]: With dead ends: 172 [2025-02-08 07:40:49,103 INFO L226 Difference]: Without dead ends: 172 [2025-02-08 07:40:49,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:40:49,104 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 4 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:49,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 663 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:40:49,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-02-08 07:40:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-02-08 07:40:49,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 106 states have (on average 1.7452830188679245) internal successors, (185), 169 states have internal predecessors, (185), 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-02-08 07:40:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 187 transitions. [2025-02-08 07:40:49,109 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 187 transitions. Word has length 17 [2025-02-08 07:40:49,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:49,109 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 187 transitions. [2025-02-08 07:40:49,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:40:49,109 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2025-02-08 07:40:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 07:40:49,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:49,109 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:49,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 07:40:49,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:49,310 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:49,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:49,310 INFO L85 PathProgramCache]: Analyzing trace with hash -121856986, now seen corresponding path program 2 times [2025-02-08 07:40:49,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:49,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351743415] [2025-02-08 07:40:49,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:40:49,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:49,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-08 07:40:49,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 29 statements. [2025-02-08 07:40:49,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:40:49,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-08 07:40:49,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:49,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351743415] [2025-02-08 07:40:49,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351743415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:49,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:49,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:40:49,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42128080] [2025-02-08 07:40:49,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:49,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:40:49,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:49,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:40:49,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:49,773 INFO L87 Difference]: Start difference. First operand 172 states and 187 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-08 07:40:49,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:49,967 INFO L93 Difference]: Finished difference Result 262 states and 291 transitions. [2025-02-08 07:40:49,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:40:49,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 29 [2025-02-08 07:40:49,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:49,969 INFO L225 Difference]: With dead ends: 262 [2025-02-08 07:40:49,969 INFO L226 Difference]: Without dead ends: 262 [2025-02-08 07:40:49,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:49,970 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 242 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:49,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 494 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:40:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-08 07:40:49,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 171. [2025-02-08 07:40:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 106 states have (on average 1.7358490566037736) internal successors, (184), 168 states have internal predecessors, (184), 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-02-08 07:40:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 186 transitions. [2025-02-08 07:40:49,978 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 186 transitions. Word has length 29 [2025-02-08 07:40:49,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:49,979 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 186 transitions. [2025-02-08 07:40:49,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-08 07:40:49,979 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 186 transitions. [2025-02-08 07:40:49,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 07:40:49,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:49,979 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:49,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 07:40:49,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:49,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash -121856987, now seen corresponding path program 1 times [2025-02-08 07:40:49,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:49,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624188273] [2025-02-08 07:40:49,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:50,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 07:40:50,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 07:40:50,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:50,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:50,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:50,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624188273] [2025-02-08 07:40:50,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624188273] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:50,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682286733] [2025-02-08 07:40:50,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:50,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:50,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:50,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:50,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 07:40:50,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 07:40:50,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 07:40:50,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:50,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:50,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 07:40:50,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:50,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:40:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:50,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682286733] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:40:50,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:40:50,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-02-08 07:40:50,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266564113] [2025-02-08 07:40:50,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:40:50,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:40:50,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:50,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:40:50,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:40:50,583 INFO L87 Difference]: Start difference. First operand 171 states and 186 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:40:50,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:50,643 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2025-02-08 07:40:50,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:40:50,643 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-02-08 07:40:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:50,644 INFO L225 Difference]: With dead ends: 183 [2025-02-08 07:40:50,644 INFO L226 Difference]: Without dead ends: 183 [2025-02-08 07:40:50,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:40:50,646 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 2 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:50,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 987 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:40:50,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-08 07:40:50,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-02-08 07:40:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 118 states have (on average 1.6610169491525424) internal successors, (196), 180 states have internal predecessors, (196), 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-02-08 07:40:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2025-02-08 07:40:50,651 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 29 [2025-02-08 07:40:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:50,651 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2025-02-08 07:40:50,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:40:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2025-02-08 07:40:50,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 07:40:50,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:50,651 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:50,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 07:40:50,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:50,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:50,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:50,853 INFO L85 PathProgramCache]: Analyzing trace with hash 747173093, now seen corresponding path program 2 times [2025-02-08 07:40:50,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:50,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645062725] [2025-02-08 07:40:50,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:40:50,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:50,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-02-08 07:40:50,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 41 statements. [2025-02-08 07:40:50,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:40:50,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:50,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:50,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645062725] [2025-02-08 07:40:50,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645062725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:50,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:50,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:40:50,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097353677] [2025-02-08 07:40:50,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:50,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:50,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:50,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:50,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:50,991 INFO L87 Difference]: Start difference. First operand 183 states and 198 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:51,071 INFO L93 Difference]: Finished difference Result 194 states and 210 transitions. [2025-02-08 07:40:51,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:51,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2025-02-08 07:40:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:51,072 INFO L225 Difference]: With dead ends: 194 [2025-02-08 07:40:51,072 INFO L226 Difference]: Without dead ends: 194 [2025-02-08 07:40:51,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:51,073 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 132 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:51,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 132 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:51,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-08 07:40:51,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 178. [2025-02-08 07:40:51,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 118 states have (on average 1.61864406779661) internal successors, (191), 175 states have internal predecessors, (191), 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-02-08 07:40:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2025-02-08 07:40:51,077 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 41 [2025-02-08 07:40:51,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:51,077 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2025-02-08 07:40:51,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2025-02-08 07:40:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 07:40:51,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:51,078 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:51,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 07:40:51,078 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:51,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1781644312, now seen corresponding path program 1 times [2025-02-08 07:40:51,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:51,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883657530] [2025-02-08 07:40:51,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:51,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:51,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 07:40:51,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 07:40:51,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:51,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:51,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:51,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883657530] [2025-02-08 07:40:51,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883657530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:51,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:51,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:40:51,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232684152] [2025-02-08 07:40:51,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:51,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:40:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:51,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:40:51,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:51,467 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-02-08 07:40:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:51,670 INFO L93 Difference]: Finished difference Result 206 states and 225 transitions. [2025-02-08 07:40:51,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:40:51,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 44 [2025-02-08 07:40:51,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:51,671 INFO L225 Difference]: With dead ends: 206 [2025-02-08 07:40:51,672 INFO L226 Difference]: Without dead ends: 206 [2025-02-08 07:40:51,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:40:51,672 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 347 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:51,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 209 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:40:51,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-08 07:40:51,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 191. [2025-02-08 07:40:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 132 states have (on average 1.606060606060606) internal successors, (212), 188 states have internal predecessors, (212), 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-02-08 07:40:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 214 transitions. [2025-02-08 07:40:51,675 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 214 transitions. Word has length 44 [2025-02-08 07:40:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:51,676 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 214 transitions. [2025-02-08 07:40:51,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-02-08 07:40:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 214 transitions. [2025-02-08 07:40:51,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 07:40:51,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:51,676 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:51,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 07:40:51,677 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:51,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:51,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1781645241, now seen corresponding path program 1 times [2025-02-08 07:40:51,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:51,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026051086] [2025-02-08 07:40:51,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:51,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:51,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 07:40:51,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 07:40:51,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:51,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:51,836 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:51,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:51,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026051086] [2025-02-08 07:40:51,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026051086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:51,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:51,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:40:51,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059287289] [2025-02-08 07:40:51,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:51,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:40:51,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:51,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:40:51,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:40:51,838 INFO L87 Difference]: Start difference. First operand 191 states and 214 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-02-08 07:40:51,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:51,951 INFO L93 Difference]: Finished difference Result 208 states and 232 transitions. [2025-02-08 07:40:51,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:40:51,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 44 [2025-02-08 07:40:51,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:51,953 INFO L225 Difference]: With dead ends: 208 [2025-02-08 07:40:51,953 INFO L226 Difference]: Without dead ends: 208 [2025-02-08 07:40:51,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:40:51,953 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 204 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:51,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 168 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:51,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-02-08 07:40:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 186. [2025-02-08 07:40:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 132 states have (on average 1.5681818181818181) internal successors, (207), 183 states have internal predecessors, (207), 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-02-08 07:40:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 209 transitions. [2025-02-08 07:40:51,957 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 209 transitions. Word has length 44 [2025-02-08 07:40:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:51,957 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 209 transitions. [2025-02-08 07:40:51,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-02-08 07:40:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 209 transitions. [2025-02-08 07:40:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 07:40:51,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:51,957 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:51,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 07:40:51,958 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:51,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:51,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1781645240, now seen corresponding path program 1 times [2025-02-08 07:40:51,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:51,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259129602] [2025-02-08 07:40:51,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:51,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:51,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 07:40:52,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 07:40:52,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:52,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:52,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:52,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259129602] [2025-02-08 07:40:52,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259129602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:52,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:52,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:40:52,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795234723] [2025-02-08 07:40:52,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:52,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:40:52,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:52,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:40:52,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:52,164 INFO L87 Difference]: Start difference. First operand 186 states and 209 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-02-08 07:40:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:52,224 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2025-02-08 07:40:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:40:52,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 44 [2025-02-08 07:40:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:52,226 INFO L225 Difference]: With dead ends: 191 [2025-02-08 07:40:52,226 INFO L226 Difference]: Without dead ends: 191 [2025-02-08 07:40:52,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:52,226 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 166 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:52,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 564 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:52,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-08 07:40:52,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 186. [2025-02-08 07:40:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 132 states have (on average 1.5606060606060606) internal successors, (206), 183 states have internal predecessors, (206), 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-02-08 07:40:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2025-02-08 07:40:52,234 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 44 [2025-02-08 07:40:52,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:52,234 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2025-02-08 07:40:52,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-02-08 07:40:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2025-02-08 07:40:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 07:40:52,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:52,235 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:52,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 07:40:52,235 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:52,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:52,235 INFO L85 PathProgramCache]: Analyzing trace with hash 240347648, now seen corresponding path program 1 times [2025-02-08 07:40:52,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:52,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186513080] [2025-02-08 07:40:52,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:52,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:52,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 07:40:52,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 07:40:52,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:52,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:52,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:52,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186513080] [2025-02-08 07:40:52,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186513080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:52,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:52,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:40:52,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693666141] [2025-02-08 07:40:52,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:52,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:52,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:52,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:52,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:52,453 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 07:40:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:52,530 INFO L93 Difference]: Finished difference Result 191 states and 215 transitions. [2025-02-08 07:40:52,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:52,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 47 [2025-02-08 07:40:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:52,532 INFO L225 Difference]: With dead ends: 191 [2025-02-08 07:40:52,532 INFO L226 Difference]: Without dead ends: 191 [2025-02-08 07:40:52,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:52,532 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 120 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:52,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 128 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:52,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-08 07:40:52,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2025-02-08 07:40:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 137 states have (on average 1.5547445255474452) internal successors, (213), 187 states have internal predecessors, (213), 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-02-08 07:40:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 215 transitions. [2025-02-08 07:40:52,537 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 215 transitions. Word has length 47 [2025-02-08 07:40:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:52,537 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 215 transitions. [2025-02-08 07:40:52,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 07:40:52,537 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 215 transitions. [2025-02-08 07:40:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 07:40:52,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:52,537 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:52,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 07:40:52,538 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:52,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:52,538 INFO L85 PathProgramCache]: Analyzing trace with hash 240347649, now seen corresponding path program 1 times [2025-02-08 07:40:52,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:52,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507714967] [2025-02-08 07:40:52,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:52,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:52,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 07:40:52,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 07:40:52,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:52,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:53,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:53,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507714967] [2025-02-08 07:40:53,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507714967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:53,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:53,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:40:53,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915464777] [2025-02-08 07:40:53,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:53,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:40:53,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:53,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:40:53,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:40:53,073 INFO L87 Difference]: Start difference. First operand 190 states and 215 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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-02-08 07:40:53,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:53,366 INFO L93 Difference]: Finished difference Result 194 states and 214 transitions. [2025-02-08 07:40:53,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:40:53,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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 47 [2025-02-08 07:40:53,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:53,367 INFO L225 Difference]: With dead ends: 194 [2025-02-08 07:40:53,367 INFO L226 Difference]: Without dead ends: 194 [2025-02-08 07:40:53,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:40:53,368 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 16 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:53,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 370 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:40:53,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-08 07:40:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 190. [2025-02-08 07:40:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 137 states have (on average 1.5474452554744527) internal successors, (212), 187 states have internal predecessors, (212), 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-02-08 07:40:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 214 transitions. [2025-02-08 07:40:53,371 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 214 transitions. Word has length 47 [2025-02-08 07:40:53,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:53,371 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 214 transitions. [2025-02-08 07:40:53,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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-02-08 07:40:53,371 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 214 transitions. [2025-02-08 07:40:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 07:40:53,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:53,372 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:53,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 07:40:53,372 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:53,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:53,373 INFO L85 PathProgramCache]: Analyzing trace with hash 486524448, now seen corresponding path program 1 times [2025-02-08 07:40:53,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:53,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082848876] [2025-02-08 07:40:53,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:53,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:53,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 07:40:53,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 07:40:53,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:53,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:53,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:53,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082848876] [2025-02-08 07:40:53,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082848876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:53,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:53,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:40:53,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757513062] [2025-02-08 07:40:53,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:53,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:40:53,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:53,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:40:53,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:40:53,639 INFO L87 Difference]: Start difference. First operand 190 states and 214 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-02-08 07:40:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:53,775 INFO L93 Difference]: Finished difference Result 189 states and 212 transitions. [2025-02-08 07:40:53,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:40:53,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 50 [2025-02-08 07:40:53,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:53,776 INFO L225 Difference]: With dead ends: 189 [2025-02-08 07:40:53,776 INFO L226 Difference]: Without dead ends: 189 [2025-02-08 07:40:53,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:53,776 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 12 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:53,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 415 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:53,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-08 07:40:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-02-08 07:40:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 137 states have (on average 1.532846715328467) internal successors, (210), 186 states have internal predecessors, (210), 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-02-08 07:40:53,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 212 transitions. [2025-02-08 07:40:53,783 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 212 transitions. Word has length 50 [2025-02-08 07:40:53,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:53,783 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 212 transitions. [2025-02-08 07:40:53,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-02-08 07:40:53,784 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 212 transitions. [2025-02-08 07:40:53,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 07:40:53,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:53,784 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:53,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 07:40:53,784 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:53,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:53,785 INFO L85 PathProgramCache]: Analyzing trace with hash 486524449, now seen corresponding path program 1 times [2025-02-08 07:40:53,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:53,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799449939] [2025-02-08 07:40:53,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:53,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:53,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 07:40:53,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 07:40:53,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:53,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:54,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:54,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799449939] [2025-02-08 07:40:54,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799449939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:54,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:54,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:40:54,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178849573] [2025-02-08 07:40:54,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:54,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:40:54,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:54,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:40:54,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:40:54,189 INFO L87 Difference]: Start difference. First operand 189 states and 212 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-02-08 07:40:54,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:54,330 INFO L93 Difference]: Finished difference Result 188 states and 210 transitions. [2025-02-08 07:40:54,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:40:54,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 50 [2025-02-08 07:40:54,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:54,331 INFO L225 Difference]: With dead ends: 188 [2025-02-08 07:40:54,331 INFO L226 Difference]: Without dead ends: 188 [2025-02-08 07:40:54,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:54,332 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 11 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:54,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 423 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:54,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-08 07:40:54,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-02-08 07:40:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 185 states have internal predecessors, (208), 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-02-08 07:40:54,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2025-02-08 07:40:54,336 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 50 [2025-02-08 07:40:54,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:54,336 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2025-02-08 07:40:54,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-02-08 07:40:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2025-02-08 07:40:54,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 07:40:54,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:54,339 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:54,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 07:40:54,340 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:54,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:54,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1842801108, now seen corresponding path program 1 times [2025-02-08 07:40:54,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:54,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784818543] [2025-02-08 07:40:54,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:54,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:54,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 07:40:54,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 07:40:54,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:54,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:54,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:54,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784818543] [2025-02-08 07:40:54,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784818543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:54,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:54,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:40:54,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652558307] [2025-02-08 07:40:54,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:54,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:54,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:54,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:54,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:54,482 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-02-08 07:40:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:54,504 INFO L93 Difference]: Finished difference Result 200 states and 225 transitions. [2025-02-08 07:40:54,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:54,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 54 [2025-02-08 07:40:54,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:54,506 INFO L225 Difference]: With dead ends: 200 [2025-02-08 07:40:54,506 INFO L226 Difference]: Without dead ends: 200 [2025-02-08 07:40:54,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:54,507 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 6 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:54,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 301 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:40:54,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-08 07:40:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 190. [2025-02-08 07:40:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 139 states have (on average 1.5107913669064748) internal successors, (210), 187 states have internal predecessors, (210), 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-02-08 07:40:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2025-02-08 07:40:54,511 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 54 [2025-02-08 07:40:54,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:54,511 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2025-02-08 07:40:54,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-02-08 07:40:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2025-02-08 07:40:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 07:40:54,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:54,512 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 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] [2025-02-08 07:40:54,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 07:40:54,512 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:54,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:54,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1292506038, now seen corresponding path program 1 times [2025-02-08 07:40:54,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:54,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716467400] [2025-02-08 07:40:54,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:54,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 07:40:54,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 07:40:54,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:54,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:54,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:54,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716467400] [2025-02-08 07:40:54,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716467400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:54,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:54,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:40:54,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202788595] [2025-02-08 07:40:54,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:54,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:40:54,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:54,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:40:54,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:40:54,650 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-02-08 07:40:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:54,767 INFO L93 Difference]: Finished difference Result 189 states and 210 transitions. [2025-02-08 07:40:54,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:40:54,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 55 [2025-02-08 07:40:54,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:54,769 INFO L225 Difference]: With dead ends: 189 [2025-02-08 07:40:54,769 INFO L226 Difference]: Without dead ends: 189 [2025-02-08 07:40:54,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:54,769 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 5 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:54,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 455 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:54,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-08 07:40:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-02-08 07:40:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 139 states have (on average 1.4964028776978417) internal successors, (208), 186 states have internal predecessors, (208), 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-02-08 07:40:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 210 transitions. [2025-02-08 07:40:54,773 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 210 transitions. Word has length 55 [2025-02-08 07:40:54,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:54,773 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 210 transitions. [2025-02-08 07:40:54,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-02-08 07:40:54,773 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 210 transitions. [2025-02-08 07:40:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 07:40:54,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:54,774 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 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] [2025-02-08 07:40:54,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 07:40:54,774 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:54,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:54,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1292506039, now seen corresponding path program 1 times [2025-02-08 07:40:54,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:54,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449550705] [2025-02-08 07:40:54,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:54,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:54,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 07:40:54,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 07:40:54,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:54,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:55,268 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:55,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:55,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449550705] [2025-02-08 07:40:55,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449550705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:55,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:55,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:40:55,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536936824] [2025-02-08 07:40:55,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:55,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:40:55,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:55,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:40:55,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:40:55,270 INFO L87 Difference]: Start difference. First operand 189 states and 210 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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-02-08 07:40:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:55,487 INFO L93 Difference]: Finished difference Result 197 states and 219 transitions. [2025-02-08 07:40:55,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:40:55,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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 55 [2025-02-08 07:40:55,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:55,489 INFO L225 Difference]: With dead ends: 197 [2025-02-08 07:40:55,489 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 07:40:55,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:40:55,489 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 11 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:55,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:40:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 07:40:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2025-02-08 07:40:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 145 states have (on average 1.4827586206896552) internal successors, (215), 192 states have internal predecessors, (215), 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-02-08 07:40:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 217 transitions. [2025-02-08 07:40:55,497 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 217 transitions. Word has length 55 [2025-02-08 07:40:55,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:55,497 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 217 transitions. [2025-02-08 07:40:55,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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-02-08 07:40:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 217 transitions. [2025-02-08 07:40:55,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 07:40:55,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:55,497 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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-02-08 07:40:55,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 07:40:55,498 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:55,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:55,498 INFO L85 PathProgramCache]: Analyzing trace with hash -835689197, now seen corresponding path program 1 times [2025-02-08 07:40:55,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:55,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824721532] [2025-02-08 07:40:55,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:55,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:55,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 07:40:55,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 07:40:55,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:55,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:55,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:55,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824721532] [2025-02-08 07:40:55,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824721532] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:55,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80794292] [2025-02-08 07:40:55,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:55,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:55,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:55,661 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:55,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 07:40:55,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 07:40:55,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 07:40:55,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:55,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:55,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:40:55,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:55,978 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:55,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:40:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:55,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80794292] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:40:55,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:40:55,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 07:40:55,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867396303] [2025-02-08 07:40:55,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:40:55,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:40:55,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:55,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:40:55,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:40:55,999 INFO L87 Difference]: Start difference. First operand 195 states and 217 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-02-08 07:40:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:56,032 INFO L93 Difference]: Finished difference Result 222 states and 247 transitions. [2025-02-08 07:40:56,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:40:56,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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 59 [2025-02-08 07:40:56,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:56,033 INFO L225 Difference]: With dead ends: 222 [2025-02-08 07:40:56,033 INFO L226 Difference]: Without dead ends: 222 [2025-02-08 07:40:56,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:40:56,034 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 17 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:56,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 308 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:40:56,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-08 07:40:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2025-02-08 07:40:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 169 states have (on average 1.4497041420118344) internal successors, (245), 216 states have internal predecessors, (245), 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-02-08 07:40:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 247 transitions. [2025-02-08 07:40:56,038 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 247 transitions. Word has length 59 [2025-02-08 07:40:56,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:56,038 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 247 transitions. [2025-02-08 07:40:56,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-02-08 07:40:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 247 transitions. [2025-02-08 07:40:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-08 07:40:56,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:56,039 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 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] [2025-02-08 07:40:56,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 07:40:56,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:56,240 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:56,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:56,240 INFO L85 PathProgramCache]: Analyzing trace with hash -136314792, now seen corresponding path program 1 times [2025-02-08 07:40:56,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:56,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432664548] [2025-02-08 07:40:56,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:56,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:56,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 07:40:56,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 07:40:56,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:56,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:56,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:56,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432664548] [2025-02-08 07:40:56,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432664548] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:56,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735876814] [2025-02-08 07:40:56,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:56,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:56,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:56,869 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:56,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 07:40:57,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 07:40:57,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 07:40:57,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:57,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:57,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 07:40:57,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:57,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:40:57,186 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 23 treesize of output 1 [2025-02-08 07:40:57,189 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 23 treesize of output 1 [2025-02-08 07:40:57,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2025-02-08 07:40:57,365 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 36 treesize of output 12 [2025-02-08 07:40:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:57,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:40:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:57,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735876814] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:40:57,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:40:57,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-02-08 07:40:57,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797115327] [2025-02-08 07:40:57,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:40:57,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 07:40:57,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:57,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 07:40:57,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2025-02-08 07:40:57,595 INFO L87 Difference]: Start difference. First operand 219 states and 247 transitions. Second operand has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 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-02-08 07:40:58,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:58,047 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2025-02-08 07:40:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:40:58,048 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 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 60 [2025-02-08 07:40:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:58,049 INFO L225 Difference]: With dead ends: 218 [2025-02-08 07:40:58,049 INFO L226 Difference]: Without dead ends: 218 [2025-02-08 07:40:58,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2025-02-08 07:40:58,052 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 49 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:58,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 876 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 07:40:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-08 07:40:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-08 07:40:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 169 states have (on average 1.4142011834319526) internal successors, (239), 215 states have internal predecessors, (239), 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-02-08 07:40:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 241 transitions. [2025-02-08 07:40:58,060 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 241 transitions. Word has length 60 [2025-02-08 07:40:58,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:58,060 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 241 transitions. [2025-02-08 07:40:58,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 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-02-08 07:40:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2025-02-08 07:40:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 07:40:58,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:58,061 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:58,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 07:40:58,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:58,265 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:58,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1935118484, now seen corresponding path program 2 times [2025-02-08 07:40:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:58,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120238041] [2025-02-08 07:40:58,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:40:58,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:58,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-02-08 07:40:58,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 07:40:58,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:40:58,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:58,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:58,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120238041] [2025-02-08 07:40:58,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120238041] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:58,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106707924] [2025-02-08 07:40:58,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:40:58,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:58,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:58,488 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:58,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 07:40:58,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-02-08 07:40:58,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 07:40:58,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:40:58,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:58,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 07:40:58,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:58,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:40:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:58,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106707924] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:40:58,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:40:58,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 07:40:58,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552493837] [2025-02-08 07:40:58,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:40:58,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:40:58,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:58,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:40:58,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:40:58,867 INFO L87 Difference]: Start difference. First operand 218 states and 241 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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-02-08 07:40:58,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:58,916 INFO L93 Difference]: Finished difference Result 287 states and 307 transitions. [2025-02-08 07:40:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:40:58,917 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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 74 [2025-02-08 07:40:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:58,918 INFO L225 Difference]: With dead ends: 287 [2025-02-08 07:40:58,918 INFO L226 Difference]: Without dead ends: 287 [2025-02-08 07:40:58,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:40:58,919 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 33 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:58,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 471 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:40:58,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-08 07:40:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 278. [2025-02-08 07:40:58,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 229 states have (on average 1.331877729257642) internal successors, (305), 275 states have internal predecessors, (305), 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-02-08 07:40:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 307 transitions. [2025-02-08 07:40:58,924 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 307 transitions. Word has length 74 [2025-02-08 07:40:58,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:58,925 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 307 transitions. [2025-02-08 07:40:58,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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-02-08 07:40:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 307 transitions. [2025-02-08 07:40:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 07:40:58,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:58,925 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:58,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 07:40:59,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-08 07:40:59,130 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:40:59,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:59,130 INFO L85 PathProgramCache]: Analyzing trace with hash 804038324, now seen corresponding path program 3 times [2025-02-08 07:40:59,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:59,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307676581] [2025-02-08 07:40:59,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:40:59,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:59,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 12 equivalence classes. [2025-02-08 07:40:59,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 104 statements. [2025-02-08 07:40:59,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 07:40:59,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:40:59,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:59,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307676581] [2025-02-08 07:40:59,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307676581] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:59,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500611010] [2025-02-08 07:40:59,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:40:59,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:59,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:59,530 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:59,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 07:40:59,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 12 equivalence classes. [2025-02-08 07:40:59,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 104 statements. [2025-02-08 07:40:59,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 07:40:59,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:59,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 07:40:59,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:59,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:40:59,866 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 19 treesize of output 14 [2025-02-08 07:40:59,876 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:40:59,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:00,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:00,318 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 19 treesize of output 14 [2025-02-08 07:41:00,323 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:00,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:00,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:01,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:41:01,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 72 [2025-02-08 07:41:01,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2025-02-08 07:41:01,441 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-02-08 07:41:01,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2025-02-08 07:41:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:01,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500611010] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:01,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:01,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-02-08 07:41:01,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968439888] [2025-02-08 07:41:01,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:01,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 07:41:01,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:01,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 07:41:01,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-02-08 07:41:01,472 INFO L87 Difference]: Start difference. First operand 278 states and 307 transitions. Second operand has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 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-02-08 07:41:01,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:01,924 INFO L93 Difference]: Finished difference Result 282 states and 302 transitions. [2025-02-08 07:41:01,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 07:41:01,924 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 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 104 [2025-02-08 07:41:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:01,925 INFO L225 Difference]: With dead ends: 282 [2025-02-08 07:41:01,925 INFO L226 Difference]: Without dead ends: 282 [2025-02-08 07:41:01,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-02-08 07:41:01,926 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 290 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:01,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 570 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 07:41:01,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-08 07:41:01,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 219. [2025-02-08 07:41:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 174 states have (on average 1.3563218390804597) internal successors, (236), 216 states have internal predecessors, (236), 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-02-08 07:41:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 238 transitions. [2025-02-08 07:41:01,930 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 238 transitions. Word has length 104 [2025-02-08 07:41:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:01,930 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 238 transitions. [2025-02-08 07:41:01,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 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-02-08 07:41:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 238 transitions. [2025-02-08 07:41:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 07:41:01,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:01,931 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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] [2025-02-08 07:41:01,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:02,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:02,132 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:02,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:02,132 INFO L85 PathProgramCache]: Analyzing trace with hash 804037396, now seen corresponding path program 1 times [2025-02-08 07:41:02,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:02,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358228052] [2025-02-08 07:41:02,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:02,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:02,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 07:41:02,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 07:41:02,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:02,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:02,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:02,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358228052] [2025-02-08 07:41:02,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358228052] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:02,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101286564] [2025-02-08 07:41:02,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:02,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:02,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:02,661 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:02,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 07:41:02,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 07:41:02,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 07:41:02,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:02,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:02,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 07:41:02,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:03,047 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 07:41:03,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-02-08 07:41:03,057 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:03,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:03,079 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 23 treesize of output 1 [2025-02-08 07:41:03,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2025-02-08 07:41:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-02-08 07:41:03,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:03,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2025-02-08 07:41:03,723 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-02-08 07:41:03,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2025-02-08 07:41:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:03,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101286564] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:03,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:03,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 20 [2025-02-08 07:41:03,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64926186] [2025-02-08 07:41:03,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:03,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 07:41:03,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:03,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 07:41:03,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-02-08 07:41:03,753 INFO L87 Difference]: Start difference. First operand 219 states and 238 transitions. Second operand has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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-02-08 07:41:04,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:04,309 INFO L93 Difference]: Finished difference Result 282 states and 299 transitions. [2025-02-08 07:41:04,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:41:04,310 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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 104 [2025-02-08 07:41:04,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:04,311 INFO L225 Difference]: With dead ends: 282 [2025-02-08 07:41:04,311 INFO L226 Difference]: Without dead ends: 282 [2025-02-08 07:41:04,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=585, Unknown=0, NotChecked=0, Total=812 [2025-02-08 07:41:04,311 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 548 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:04,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 573 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 07:41:04,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-08 07:41:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 218. [2025-02-08 07:41:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 174 states have (on average 1.3505747126436782) internal successors, (235), 215 states have internal predecessors, (235), 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-02-08 07:41:04,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2025-02-08 07:41:04,316 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 104 [2025-02-08 07:41:04,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:04,316 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2025-02-08 07:41:04,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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-02-08 07:41:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2025-02-08 07:41:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-08 07:41:04,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:04,318 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:04,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:04,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:04,522 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:04,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:04,522 INFO L85 PathProgramCache]: Analyzing trace with hash 73302965, now seen corresponding path program 1 times [2025-02-08 07:41:04,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:04,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925826348] [2025-02-08 07:41:04,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:04,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:04,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 07:41:04,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 07:41:04,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:04,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:05,328 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:05,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:05,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925826348] [2025-02-08 07:41:05,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925826348] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:05,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551657518] [2025-02-08 07:41:05,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:05,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:05,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:05,331 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:05,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 07:41:05,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 07:41:05,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 07:41:05,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:05,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:05,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 1529 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 07:41:05,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:05,735 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-02-08 07:41:05,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-02-08 07:41:05,758 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-02-08 07:41:05,758 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 1 case distinctions, treesize of input 21 treesize of output 23 [2025-02-08 07:41:05,888 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:05,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:05,900 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-02-08 07:41:05,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2025-02-08 07:41:05,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 07:41:06,693 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 28 treesize of output 20 [2025-02-08 07:41:06,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:06,992 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 32 treesize of output 25 [2025-02-08 07:41:06,998 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:06,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-02-08 07:41:07,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:08,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:41:08,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-02-08 07:41:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:08,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551657518] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:08,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:08,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 24 [2025-02-08 07:41:08,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217394128] [2025-02-08 07:41:08,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:08,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 07:41:08,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:08,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 07:41:08,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-02-08 07:41:08,332 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 25 states have internal predecessors, (85), 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-02-08 07:41:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:09,304 INFO L93 Difference]: Finished difference Result 448 states and 479 transitions. [2025-02-08 07:41:09,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 07:41:09,305 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 25 states have internal predecessors, (85), 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 107 [2025-02-08 07:41:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:09,306 INFO L225 Difference]: With dead ends: 448 [2025-02-08 07:41:09,306 INFO L226 Difference]: Without dead ends: 448 [2025-02-08 07:41:09,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=261, Invalid=999, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 07:41:09,307 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 502 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:09,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 699 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 07:41:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-02-08 07:41:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 241. [2025-02-08 07:41:09,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 198 states have (on average 1.4090909090909092) internal successors, (279), 238 states have internal predecessors, (279), 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-02-08 07:41:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 281 transitions. [2025-02-08 07:41:09,312 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 281 transitions. Word has length 107 [2025-02-08 07:41:09,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:09,312 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 281 transitions. [2025-02-08 07:41:09,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 25 states have internal predecessors, (85), 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-02-08 07:41:09,312 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 281 transitions. [2025-02-08 07:41:09,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-08 07:41:09,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:09,313 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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] [2025-02-08 07:41:09,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:09,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:09,514 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:09,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:09,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1414403433, now seen corresponding path program 1 times [2025-02-08 07:41:09,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:09,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38812763] [2025-02-08 07:41:09,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:09,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:09,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 07:41:09,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 07:41:09,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:09,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:10,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:10,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38812763] [2025-02-08 07:41:10,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38812763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:10,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:10,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:41:10,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886532976] [2025-02-08 07:41:10,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:10,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:41:10,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:10,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:41:10,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:41:10,080 INFO L87 Difference]: Start difference. First operand 241 states and 281 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 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-02-08 07:41:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:10,204 INFO L93 Difference]: Finished difference Result 244 states and 280 transitions. [2025-02-08 07:41:10,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:41:10,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 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 108 [2025-02-08 07:41:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:10,206 INFO L225 Difference]: With dead ends: 244 [2025-02-08 07:41:10,206 INFO L226 Difference]: Without dead ends: 244 [2025-02-08 07:41:10,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:41:10,206 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 169 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:10,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 420 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-02-08 07:41:10,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 240. [2025-02-08 07:41:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 198 states have (on average 1.404040404040404) internal successors, (278), 237 states have internal predecessors, (278), 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-02-08 07:41:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 280 transitions. [2025-02-08 07:41:10,211 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 280 transitions. Word has length 108 [2025-02-08 07:41:10,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:10,211 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 280 transitions. [2025-02-08 07:41:10,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 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-02-08 07:41:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2025-02-08 07:41:10,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-08 07:41:10,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:10,212 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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] [2025-02-08 07:41:10,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 07:41:10,212 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:10,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:10,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1431371307, now seen corresponding path program 1 times [2025-02-08 07:41:10,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:10,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853593963] [2025-02-08 07:41:10,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:10,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:10,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 07:41:10,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 07:41:10,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:10,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:10,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:10,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853593963] [2025-02-08 07:41:10,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853593963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:10,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:10,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 07:41:10,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691854347] [2025-02-08 07:41:10,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:10,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:41:10,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:10,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:41:10,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:41:10,671 INFO L87 Difference]: Start difference. First operand 240 states and 280 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-02-08 07:41:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:10,729 INFO L93 Difference]: Finished difference Result 228 states and 266 transitions. [2025-02-08 07:41:10,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:41:10,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 111 [2025-02-08 07:41:10,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:10,730 INFO L225 Difference]: With dead ends: 228 [2025-02-08 07:41:10,730 INFO L226 Difference]: Without dead ends: 228 [2025-02-08 07:41:10,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:41:10,731 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 38 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:10,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 680 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:41:10,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-08 07:41:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-02-08 07:41:10,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 192 states have (on average 1.375) internal successors, (264), 225 states have internal predecessors, (264), 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-02-08 07:41:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 266 transitions. [2025-02-08 07:41:10,735 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 266 transitions. Word has length 111 [2025-02-08 07:41:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:10,735 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 266 transitions. [2025-02-08 07:41:10,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-02-08 07:41:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 266 transitions. [2025-02-08 07:41:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-08 07:41:10,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:10,736 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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] [2025-02-08 07:41:10,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 07:41:10,736 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:10,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:10,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1546710302, now seen corresponding path program 1 times [2025-02-08 07:41:10,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:10,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261808350] [2025-02-08 07:41:10,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:10,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:10,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 07:41:10,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 07:41:10,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:10,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:11,001 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:11,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:11,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261808350] [2025-02-08 07:41:11,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261808350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:11,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:11,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:41:11,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664507137] [2025-02-08 07:41:11,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:11,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:11,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:11,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:11,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:11,002 INFO L87 Difference]: Start difference. First operand 228 states and 266 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-02-08 07:41:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:11,006 INFO L93 Difference]: Finished difference Result 219 states and 254 transitions. [2025-02-08 07:41:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:11,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 114 [2025-02-08 07:41:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:11,007 INFO L225 Difference]: With dead ends: 219 [2025-02-08 07:41:11,008 INFO L226 Difference]: Without dead ends: 219 [2025-02-08 07:41:11,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:11,008 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:11,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:41:11,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-08 07:41:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-02-08 07:41:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 187 states have (on average 1.3475935828877006) internal successors, (252), 216 states have internal predecessors, (252), 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-02-08 07:41:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 254 transitions. [2025-02-08 07:41:11,011 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 254 transitions. Word has length 114 [2025-02-08 07:41:11,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:11,012 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 254 transitions. [2025-02-08 07:41:11,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-02-08 07:41:11,012 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 254 transitions. [2025-02-08 07:41:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-08 07:41:11,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:11,012 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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] [2025-02-08 07:41:11,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 07:41:11,012 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:11,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:11,013 INFO L85 PathProgramCache]: Analyzing trace with hash -703362062, now seen corresponding path program 1 times [2025-02-08 07:41:11,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:11,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69591543] [2025-02-08 07:41:11,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:11,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:11,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 07:41:11,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 07:41:11,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:11,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:11,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:11,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69591543] [2025-02-08 07:41:11,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69591543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:11,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:11,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:41:11,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909377806] [2025-02-08 07:41:11,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:11,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:11,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:11,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:11,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:11,195 INFO L87 Difference]: Start difference. First operand 219 states and 254 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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-02-08 07:41:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:11,252 INFO L93 Difference]: Finished difference Result 218 states and 253 transitions. [2025-02-08 07:41:11,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:11,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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 115 [2025-02-08 07:41:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:11,253 INFO L225 Difference]: With dead ends: 218 [2025-02-08 07:41:11,253 INFO L226 Difference]: Without dead ends: 218 [2025-02-08 07:41:11,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:11,254 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:11,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 190 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-08 07:41:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-08 07:41:11,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 187 states have (on average 1.3422459893048129) internal successors, (251), 215 states have internal predecessors, (251), 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-02-08 07:41:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 253 transitions. [2025-02-08 07:41:11,259 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 253 transitions. Word has length 115 [2025-02-08 07:41:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:11,259 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 253 transitions. [2025-02-08 07:41:11,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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-02-08 07:41:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 253 transitions. [2025-02-08 07:41:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-08 07:41:11,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:11,261 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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] [2025-02-08 07:41:11,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 07:41:11,261 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:11,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:11,262 INFO L85 PathProgramCache]: Analyzing trace with hash -703362061, now seen corresponding path program 1 times [2025-02-08 07:41:11,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:11,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345750877] [2025-02-08 07:41:11,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:11,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:11,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 07:41:11,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 07:41:11,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:11,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:11,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:11,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345750877] [2025-02-08 07:41:11,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345750877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:11,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:11,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:41:11,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150726613] [2025-02-08 07:41:11,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:11,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:11,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:11,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:11,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:11,547 INFO L87 Difference]: Start difference. First operand 218 states and 253 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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-02-08 07:41:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:11,593 INFO L93 Difference]: Finished difference Result 217 states and 252 transitions. [2025-02-08 07:41:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:11,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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 115 [2025-02-08 07:41:11,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:11,594 INFO L225 Difference]: With dead ends: 217 [2025-02-08 07:41:11,594 INFO L226 Difference]: Without dead ends: 217 [2025-02-08 07:41:11,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:11,594 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:11,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:41:11,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-08 07:41:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-02-08 07:41:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 187 states have (on average 1.3368983957219251) internal successors, (250), 214 states have internal predecessors, (250), 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-02-08 07:41:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 252 transitions. [2025-02-08 07:41:11,598 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 252 transitions. Word has length 115 [2025-02-08 07:41:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:11,598 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 252 transitions. [2025-02-08 07:41:11,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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-02-08 07:41:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 252 transitions. [2025-02-08 07:41:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-08 07:41:11,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:11,599 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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] [2025-02-08 07:41:11,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 07:41:11,599 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:11,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1282577852, now seen corresponding path program 1 times [2025-02-08 07:41:11,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:11,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400028206] [2025-02-08 07:41:11,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:11,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:11,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 07:41:11,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 07:41:11,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:11,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:11,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:11,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400028206] [2025-02-08 07:41:11,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400028206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:11,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:11,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:41:11,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710705754] [2025-02-08 07:41:11,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:11,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:41:11,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:11,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:41:11,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:41:11,771 INFO L87 Difference]: Start difference. First operand 217 states and 252 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-02-08 07:41:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:11,786 INFO L93 Difference]: Finished difference Result 214 states and 245 transitions. [2025-02-08 07:41:11,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:41:11,787 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), 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 118 [2025-02-08 07:41:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:11,787 INFO L225 Difference]: With dead ends: 214 [2025-02-08 07:41:11,787 INFO L226 Difference]: Without dead ends: 214 [2025-02-08 07:41:11,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-02-08 07:41:11,788 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:11,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:41:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-02-08 07:41:11,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2025-02-08 07:41:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 183 states have (on average 1.3224043715846994) internal successors, (242), 210 states have internal predecessors, (242), 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-02-08 07:41:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 244 transitions. [2025-02-08 07:41:11,792 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 244 transitions. Word has length 118 [2025-02-08 07:41:11,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:11,792 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 244 transitions. [2025-02-08 07:41:11,793 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), 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-02-08 07:41:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 244 transitions. [2025-02-08 07:41:11,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-08 07:41:11,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:11,823 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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] [2025-02-08 07:41:11,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 07:41:11,823 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:11,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:11,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1282569906, now seen corresponding path program 1 times [2025-02-08 07:41:11,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:11,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602192494] [2025-02-08 07:41:11,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:11,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:11,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 07:41:11,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 07:41:11,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:11,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:12,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:12,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602192494] [2025-02-08 07:41:12,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602192494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:12,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:12,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:41:12,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615709194] [2025-02-08 07:41:12,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:12,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:12,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:12,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:12,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:12,024 INFO L87 Difference]: Start difference. First operand 213 states and 244 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-02-08 07:41:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:12,038 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions. [2025-02-08 07:41:12,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:12,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 118 [2025-02-08 07:41:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:12,039 INFO L225 Difference]: With dead ends: 193 [2025-02-08 07:41:12,040 INFO L226 Difference]: Without dead ends: 189 [2025-02-08 07:41:12,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:12,041 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:12,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:41:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-08 07:41:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-02-08 07:41:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 159 states have (on average 1.251572327044025) internal successors, (199), 186 states have internal predecessors, (199), 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-02-08 07:41:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2025-02-08 07:41:12,048 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 118 [2025-02-08 07:41:12,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:12,048 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2025-02-08 07:41:12,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-02-08 07:41:12,048 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2025-02-08 07:41:12,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-08 07:41:12,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:12,049 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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] [2025-02-08 07:41:12,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 07:41:12,049 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:12,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:12,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1221602349, now seen corresponding path program 1 times [2025-02-08 07:41:12,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:12,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629494418] [2025-02-08 07:41:12,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:12,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:12,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-08 07:41:12,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-08 07:41:12,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:12,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:12,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:12,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629494418] [2025-02-08 07:41:12,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629494418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:12,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:12,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 07:41:12,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402010082] [2025-02-08 07:41:12,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:12,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 07:41:12,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:12,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 07:41:12,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:41:12,362 INFO L87 Difference]: Start difference. First operand 189 states and 201 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-02-08 07:41:12,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:12,381 INFO L93 Difference]: Finished difference Result 185 states and 196 transitions. [2025-02-08 07:41:12,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:41:12,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 119 [2025-02-08 07:41:12,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:12,382 INFO L225 Difference]: With dead ends: 185 [2025-02-08 07:41:12,382 INFO L226 Difference]: Without dead ends: 185 [2025-02-08 07:41:12,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:41:12,383 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 8 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:12,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 524 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:41:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-08 07:41:12,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-02-08 07:41:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 157 states have (on average 1.2356687898089171) internal successors, (194), 182 states have internal predecessors, (194), 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-02-08 07:41:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2025-02-08 07:41:12,395 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 119 [2025-02-08 07:41:12,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:12,395 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2025-02-08 07:41:12,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-02-08 07:41:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2025-02-08 07:41:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-08 07:41:12,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:12,401 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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] [2025-02-08 07:41:12,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 07:41:12,401 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:12,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1433756262, now seen corresponding path program 1 times [2025-02-08 07:41:12,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:12,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202063851] [2025-02-08 07:41:12,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:12,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:12,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-08 07:41:12,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-08 07:41:12,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:12,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:12,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202063851] [2025-02-08 07:41:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202063851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:12,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:12,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:41:12,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310550845] [2025-02-08 07:41:12,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:12,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:41:12,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:12,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:41:12,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:41:12,609 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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-02-08 07:41:12,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:12,713 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2025-02-08 07:41:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:41:12,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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 121 [2025-02-08 07:41:12,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:12,715 INFO L225 Difference]: With dead ends: 182 [2025-02-08 07:41:12,715 INFO L226 Difference]: Without dead ends: 182 [2025-02-08 07:41:12,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:41:12,715 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 27 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:12,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 251 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-08 07:41:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-02-08 07:41:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 157 states have (on average 1.21656050955414) internal successors, (191), 179 states have internal predecessors, (191), 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-02-08 07:41:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2025-02-08 07:41:12,729 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 121 [2025-02-08 07:41:12,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:12,730 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2025-02-08 07:41:12,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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-02-08 07:41:12,730 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2025-02-08 07:41:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-08 07:41:12,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:12,731 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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] [2025-02-08 07:41:12,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 07:41:12,732 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:12,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1496771229, now seen corresponding path program 1 times [2025-02-08 07:41:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:12,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384679979] [2025-02-08 07:41:12,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:12,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 07:41:12,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 07:41:12,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:12,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 07:41:12,859 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 07:41:12,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 07:41:12,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 07:41:12,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:12,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 07:41:13,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 07:41:13,045 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 07:41:13,050 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE (93 of 94 remaining) [2025-02-08 07:41:13,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (92 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (91 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (90 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (89 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (88 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (87 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (86 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (85 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (84 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (83 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (82 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (81 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (80 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE (73 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE (72 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 94 remaining) [2025-02-08 07:41:13,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE (69 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE (68 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE (67 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE (66 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE (61 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE (50 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE (49 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK (44 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 94 remaining) [2025-02-08 07:41:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE (29 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE (28 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE (27 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE (26 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 94 remaining) [2025-02-08 07:41:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 94 remaining) [2025-02-08 07:41:13,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 94 remaining) [2025-02-08 07:41:13,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 94 remaining) [2025-02-08 07:41:13,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 94 remaining) [2025-02-08 07:41:13,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 94 remaining) [2025-02-08 07:41:13,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 07:41:13,071 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 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-02-08 07:41:13,169 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 07:41:13,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 07:41:13 BoogieIcfgContainer [2025-02-08 07:41:13,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 07:41:13,178 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 07:41:13,178 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 07:41:13,178 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 07:41:13,183 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:40:45" (3/4) ... [2025-02-08 07:41:13,187 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 07:41:13,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 07:41:13,189 INFO L158 Benchmark]: Toolchain (without parser) took 29309.34ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 103.2MB in the beginning and 63.9MB in the end (delta: 39.4MB). Peak memory consumption was 125.6MB. Max. memory is 16.1GB. [2025-02-08 07:41:13,189 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 07:41:13,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 675.90ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 57.0MB in the end (delta: 46.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-08 07:41:13,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.93ms. Allocated memory is still 142.6MB. Free memory was 57.0MB in the beginning and 50.8MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 07:41:13,189 INFO L158 Benchmark]: Boogie Preprocessor took 100.91ms. Allocated memory is still 142.6MB. Free memory was 50.8MB in the beginning and 40.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 07:41:13,189 INFO L158 Benchmark]: IcfgBuilder took 1009.98ms. Allocated memory is still 142.6MB. Free memory was 40.2MB in the beginning and 86.0MB in the end (delta: -45.8MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2025-02-08 07:41:13,189 INFO L158 Benchmark]: TraceAbstraction took 27450.38ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 86.0MB in the beginning and 63.9MB in the end (delta: 22.1MB). Peak memory consumption was 107.3MB. Max. memory is 16.1GB. [2025-02-08 07:41:13,189 INFO L158 Benchmark]: Witness Printer took 9.83ms. Allocated memory is still 226.5MB. Free memory was 63.9MB in the beginning and 63.9MB in the end (delta: 29.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 07:41:13,190 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 675.90ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 57.0MB in the end (delta: 46.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.93ms. Allocated memory is still 142.6MB. Free memory was 57.0MB in the beginning and 50.8MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.91ms. Allocated memory is still 142.6MB. Free memory was 50.8MB in the beginning and 40.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1009.98ms. Allocated memory is still 142.6MB. Free memory was 40.2MB in the beginning and 86.0MB in the end (delta: -45.8MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 27450.38ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 86.0MB in the beginning and 63.9MB in the end (delta: 22.1MB). Peak memory consumption was 107.3MB. Max. memory is 16.1GB. * Witness Printer took 9.83ms. Allocated memory is still 226.5MB. Free memory was 63.9MB in the beginning and 63.9MB in the end (delta: 29.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1397]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: overapproximation of strrchr at line 1424. Possible FailurePath: [L1318] static const char *applet_name; [L1319] static signed int bb_errno_location; [L1320] static signed int * const bb_errno; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1575] char *a = malloc(11); [L1576] a[10] = 0 VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=0] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=1] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=2] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=3] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=4] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=5] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=6] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=7] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=8] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=9] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=10] [L1577] COND FALSE !(i<10) [L1579] applet_name = a [L1580] bb_errno_location = __VERIFIER_nondet_int() [L1581] optind = 1 [L1582] int argc = __VERIFIER_nondet_int(); [L1583] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1583] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [a={-1:0}, applet_name={-1:0}, argc=1, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1584] char **argv=malloc((argc+1)*sizeof(char*)); [L1585] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1586] argv[argc]=0 VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1587] int i=0; VAL [a={-1:0}, applet_name={-1:0}, argc=1, argv={-13:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=0, mem_track={-12:0}, optind=1] [L1587] COND TRUE i= 2u [L1394] FCALL bb_show_usage() [L1395] argv = argv + 1l VAL [applet_name={-1:0}, argv={-13:8}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1396] EXPR \read(**argv) VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1396] CALL, EXPR bb_get_last_path_component_strip(*argv) [L1443] char *slash; [L1444] CALL, EXPR last_char_is(path, 47) [L1482] COND FALSE !(!(s == ((const char *)((void *)0)))) VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1495] return (char *)((void *)0); [L1444] RET, EXPR last_char_is(path, 47) [L1444] slash=last_char_is(path, 47) [L1445] char *tmp_post$1; VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}, slash={0:0}] [L1446] COND FALSE !(!(slash == ((char *)((void *)0)))) VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1454] char *return_value_bb_get_last_path_component_nostrip$2; [L1455] CALL, EXPR bb_get_last_path_component_nostrip(path) [L1423] char *slash; VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}] [L1424] slash=strrchr(path, 47) [L1425] _Bool tmp_if_expr$2; [L1426] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}, slash={-25:0}] [L1427] COND FALSE !(slash == ((char *)((void *)0))) VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1431] COND FALSE !(slash == path) [L1434] tmp_if_expr$1 = 0 != 0 VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}, slash={-25:0}, tmp_if_expr$1=0] [L1435] tmp_if_expr$2 = (tmp_if_expr$1 != (_Bool)0 ? (signed int)(1 != 0) : (signed int)(0 != 0)) != 0 VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}, slash={-25:0}, tmp_if_expr$2=0] [L1437] COND FALSE !(!(tmp_if_expr$2 == (_Bool)0)) [L1439] return slash + (signed long int)1; [L1455] RET, EXPR bb_get_last_path_component_nostrip(path) [L1455] return_value_bb_get_last_path_component_nostrip$2=bb_get_last_path_component_nostrip(path) [L1456] return return_value_bb_get_last_path_component_nostrip$2; [L1396] RET, EXPR bb_get_last_path_component_strip(*argv) [L1396] s=bb_get_last_path_component_strip(*argv) [L1397] strlen(s) VAL [applet_name={-1:0}, argv={-13:8}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, s={-25:1}] [L1397] strlen(s) VAL [applet_name={-1:0}, argv={-13:8}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] - UnprovableResult [Line: 1573]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1597]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1597]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1597]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1402]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1402]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1397]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1488]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1488]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1342]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1342]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 229 locations, 94 error locations. Started 1 CEGAR loops. OverallTime: 27.3s, OverallIterations: 34, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3617 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3612 mSDsluCounter, 13939 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9727 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6045 IncrementalHoareTripleChecker+Invalid, 6158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 4212 mSDtfsCounter, 6045 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1310 GetRequests, 1066 SyntacticMatches, 6 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=21, InterpolantAutomatonStates: 209, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 537 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 2854 NumberOfCodeBlocks, 2652 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 3243 ConstructedInterpolants, 122 QuantifiedInterpolants, 22375 SizeOfPredicates, 41 NumberOfNonLiveVariables, 10686 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 51 InterpolantComputations, 24 PerfectInterpolantSequences, 9651/10129 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 07:41:13,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:41:15,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:41:15,154 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2025-02-08 07:41:15,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:41:15,159 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:41:15,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:41:15,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:41:15,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:41:15,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:41:15,185 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:41:15,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:41:15,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:41:15,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:41:15,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:41:15,187 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:41:15,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:41:15,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:41:15,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:41:15,187 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:41:15,187 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:41:15,187 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:41:15,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:41:15,187 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:41:15,187 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 07:41:15,188 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 07:41:15,188 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:41:15,188 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:41:15,188 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:41:15,188 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:41:15,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:41:15,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:41:15,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:41:15,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:41:15,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:41:15,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:41:15,188 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 07:41:15,188 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 07:41:15,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:41:15,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:41:15,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:41:15,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:41:15,189 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 [2025-02-08 07:41:15,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:41:15,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:41:15,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:41:15,465 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:41:15,465 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:41:15,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2025-02-08 07:41:16,670 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9172c4979/2473d7ac7c864711a489c2318e2fee01/FLAG80d0e12b3 [2025-02-08 07:41:16,946 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:41:16,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2025-02-08 07:41:16,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9172c4979/2473d7ac7c864711a489c2318e2fee01/FLAG80d0e12b3 [2025-02-08 07:41:16,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9172c4979/2473d7ac7c864711a489c2318e2fee01 [2025-02-08 07:41:16,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:41:16,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:41:16,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:41:16,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:41:16,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:41:16,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:41:16" (1/1) ... [2025-02-08 07:41:16,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2052aaac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:41:16, skipping insertion in model container [2025-02-08 07:41:16,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:41:16" (1/1) ... [2025-02-08 07:41:17,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:41:17,452 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:41:17,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-02-08 07:41:17,470 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:41:17,472 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:41:17,474 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:41:17,480 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:41:17,481 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:41:17,482 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:41:17,483 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:41:17,484 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:41:17,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-02-08 07:41:17,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:41:17,532 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:41:17,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:41:17,736 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:41:17,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:41:17 WrapperNode [2025-02-08 07:41:17,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:41:17,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:41:17,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:41:17,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:41:17,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:41:17" (1/1) ... [2025-02-08 07:41:17,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:41:17" (1/1) ... [2025-02-08 07:41:17,826 INFO L138 Inliner]: procedures = 353, calls = 461, calls flagged for inlining = 12, calls inlined = 11, statements flattened = 718 [2025-02-08 07:41:17,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:41:17,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:41:17,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:41:17,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:41:17,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:41:17" (1/1) ... [2025-02-08 07:41:17,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:41:17" (1/1) ... [2025-02-08 07:41:17,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:41:17" (1/1) ... [2025-02-08 07:41:17,878 INFO L175 MemorySlicer]: Split 410 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 355, 2, 2, 12, 12, 1]. 87 percent of accesses are in the largest equivalence class. The 378 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 355, 0, 0, 0, 0, 0]. The 10 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 2, 5, 0]. [2025-02-08 07:41:17,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:41:17" (1/1) ... [2025-02-08 07:41:17,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:41:17" (1/1) ... [2025-02-08 07:41:17,915 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:41:17" (1/1) ... [2025-02-08 07:41:17,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:41:17" (1/1) ... [2025-02-08 07:41:17,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:41:17" (1/1) ... [2025-02-08 07:41:17,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:41:17" (1/1) ... [2025-02-08 07:41:17,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:41:17,949 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:41:17,949 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:41:17,950 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:41:17,950 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:41:17" (1/1) ... [2025-02-08 07:41:17,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:41:17,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:17,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 07:41:17,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 07:41:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 07:41:17,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 07:41:17,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-08 07:41:17,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-02-08 07:41:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-02-08 07:41:17,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-02-08 07:41:17,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-02-08 07:41:17,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-02-08 07:41:17,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-02-08 07:41:17,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-02-08 07:41:17,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-02-08 07:41:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:41:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:41:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 07:41:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 07:41:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 07:41:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 07:41:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 07:41:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 07:41:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 07:41:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 07:41:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 07:41:18,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 07:41:18,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 07:41:18,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 07:41:18,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 07:41:18,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 07:41:18,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:41:18,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:41:18,270 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:41:18,272 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:41:19,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1505: safe_write_~tmp_if_expr$1~1#1 := (if 0bv32 == (if 0bv32 != (if 4bv32 == safe_write_#t~mem72#1 then 1bv32 else 0bv32) then 1bv32 else 0bv32) then 0bv8 else 1bv8); [2025-02-08 07:41:19,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1505-1: SUMMARY for call safe_write_#t~mem72#1 := read~intINTTYPE4#13(~bb_errno~0.base, ~bb_errno~0.offset, 4bv64); srcloc: null [2025-02-08 07:41:19,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1505-1: assume !(1bv1 == #valid[~bb_errno~0.base]); [2025-02-08 07:41:19,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1505-1: assume !((~bvule~64(~bvadd~64(4bv64, ~bb_errno~0.offset), #length[~bb_errno~0.base]) && ~bvule~64(~bb_errno~0.offset, ~bvadd~64(4bv64, ~bb_errno~0.offset))) && ~bvule~64(0bv64, ~bb_errno~0.offset)); [2025-02-08 07:41:19,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1468: full_write_#t~ret67#1 := safe_write_#res#1;havoc safe_write_#t~ret71#1, safe_write_#t~mem72#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~1#1, safe_write_~tmp_if_expr$1~1#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;full_write_~cc~0#1 := full_write_#t~ret67#1;havoc full_write_#t~ret67#1; [2025-02-08 07:41:19,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501-1: assume 0bv8 != safe_write_~tmp_if_expr$1~1#1; [2025-02-08 07:41:19,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501-1: assume !(0bv8 != safe_write_~tmp_if_expr$1~1#1); [2025-02-08 07:41:19,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1469: assume ~bvslt~64(full_write_~cc~0#1, 0bv64); [2025-02-08 07:41:19,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1469: assume !~bvslt~64(full_write_~cc~0#1, 0bv64);full_write_~total~0#1 := ~bvadd~64(full_write_~total~0#1, full_write_~cc~0#1);full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, ~bvadd~64(full_write_~buf#1.offset, full_write_~cc~0#1);full_write_~len#1 := ~bvsub~64(full_write_~len#1, full_write_~cc~0#1); [2025-02-08 07:41:19,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1503: safe_write_#t~ret71#1 := write_#res#1;havoc write_#t~nondet104#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;safe_write_~n~1#1 := safe_write_#t~ret71#1;havoc safe_write_#t~ret71#1; [2025-02-08 07:41:19,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1504: assume ~bvslt~64(safe_write_~n~1#1, 0bv64); [2025-02-08 07:41:19,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1504: assume !~bvslt~64(safe_write_~n~1#1, 0bv64);safe_write_~tmp_if_expr$1~1#1 := 0bv8; [2025-02-08 07:41:19,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1471: assume !(0bv64 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:41:19,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1471: assume !!(0bv64 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 07:41:19,155 INFO L? ?]: Removed 253 outVars from TransFormulas that were not future-live. [2025-02-08 07:41:19,155 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:41:19,168 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:41:19,170 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 07:41:19,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:41:19 BoogieIcfgContainer [2025-02-08 07:41:19,171 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:41:19,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:41:19,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:41:19,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:41:19,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:41:16" (1/3) ... [2025-02-08 07:41:19,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae0de8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:41:19, skipping insertion in model container [2025-02-08 07:41:19,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:41:17" (2/3) ... [2025-02-08 07:41:19,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae0de8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:41:19, skipping insertion in model container [2025-02-08 07:41:19,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:41:19" (3/3) ... [2025-02-08 07:41:19,181 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-1.i [2025-02-08 07:41:19,191 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:41:19,192 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG basename-1.i that has 2 procedures, 229 locations, 1 initial locations, 7 loop locations, and 94 error locations. [2025-02-08 07:41:19,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:41:19,229 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;@7bc83682, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:41:19,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2025-02-08 07:41:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 229 states, 128 states have (on average 1.984375) internal successors, (254), 225 states have internal predecessors, (254), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:41:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:41:19,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:19,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:41:19,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:19,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:19,239 INFO L85 PathProgramCache]: Analyzing trace with hash 10079, now seen corresponding path program 1 times [2025-02-08 07:41:19,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:19,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781149948] [2025-02-08 07:41:19,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:19,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:19,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:19,250 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:19,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 07:41:19,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:41:19,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:41:19,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:19,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:19,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:41:19,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:19,957 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-02-08 07:41:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:19,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:41:19,976 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:19,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781149948] [2025-02-08 07:41:19,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781149948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:19,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:19,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:41:19,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417373033] [2025-02-08 07:41:19,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:19,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:19,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:19,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:20,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:20,003 INFO L87 Difference]: Start difference. First operand has 229 states, 128 states have (on average 1.984375) internal successors, (254), 225 states have internal predecessors, (254), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:20,269 INFO L93 Difference]: Finished difference Result 186 states and 203 transitions. [2025-02-08 07:41:20,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:20,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:41:20,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:20,277 INFO L225 Difference]: With dead ends: 186 [2025-02-08 07:41:20,278 INFO L226 Difference]: Without dead ends: 175 [2025-02-08 07:41:20,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:20,284 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 156 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:20,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 143 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:41:20,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-02-08 07:41:20,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 159. [2025-02-08 07:41:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 90 states have (on average 1.9111111111111112) internal successors, (172), 156 states have internal predecessors, (172), 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-02-08 07:41:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 174 transitions. [2025-02-08 07:41:20,323 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 174 transitions. Word has length 2 [2025-02-08 07:41:20,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:20,324 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 174 transitions. [2025-02-08 07:41:20,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:20,325 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 174 transitions. [2025-02-08 07:41:20,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:41:20,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:20,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:41:20,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:20,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:20,526 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:20,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:20,526 INFO L85 PathProgramCache]: Analyzing trace with hash 10080, now seen corresponding path program 1 times [2025-02-08 07:41:20,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:20,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1522086114] [2025-02-08 07:41:20,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:20,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:20,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:20,529 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:20,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 07:41:20,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:41:21,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:41:21,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:21,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:21,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 07:41:21,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:21,161 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-02-08 07:41:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:21,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:41:21,168 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:21,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522086114] [2025-02-08 07:41:21,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522086114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:21,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:21,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:41:21,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763617530] [2025-02-08 07:41:21,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:21,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:21,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:21,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:21,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:21,170 INFO L87 Difference]: Start difference. First operand 159 states and 174 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:21,480 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2025-02-08 07:41:21,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:21,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:41:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:21,482 INFO L225 Difference]: With dead ends: 158 [2025-02-08 07:41:21,482 INFO L226 Difference]: Without dead ends: 158 [2025-02-08 07:41:21,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:21,483 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:21,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 270 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 07:41:21,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-08 07:41:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-02-08 07:41:21,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 90 states have (on average 1.9) internal successors, (171), 155 states have internal predecessors, (171), 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-02-08 07:41:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2025-02-08 07:41:21,492 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 2 [2025-02-08 07:41:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:21,492 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2025-02-08 07:41:21,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2025-02-08 07:41:21,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:41:21,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:21,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:41:21,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:21,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:21,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:21,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash 300512698, now seen corresponding path program 1 times [2025-02-08 07:41:21,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:21,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397002469] [2025-02-08 07:41:21,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:21,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:21,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:21,696 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:21,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 07:41:21,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:41:22,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:41:22,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:22,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:22,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 07:41:22,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:22,296 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-02-08 07:41:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:22,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:41:22,343 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:22,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397002469] [2025-02-08 07:41:22,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397002469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:22,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:22,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:41:22,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81761864] [2025-02-08 07:41:22,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:22,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:41:22,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:22,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:41:22,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:41:22,345 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand has 4 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-02-08 07:41:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:22,768 INFO L93 Difference]: Finished difference Result 161 states and 176 transitions. [2025-02-08 07:41:22,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:41:22,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-02-08 07:41:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:22,770 INFO L225 Difference]: With dead ends: 161 [2025-02-08 07:41:22,770 INFO L226 Difference]: Without dead ends: 161 [2025-02-08 07:41:22,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-02-08 07:41:22,771 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 7 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:22,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 268 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 07:41:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-08 07:41:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2025-02-08 07:41:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 157 states have internal predecessors, (173), 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-02-08 07:41:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 175 transitions. [2025-02-08 07:41:22,777 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 175 transitions. Word has length 5 [2025-02-08 07:41:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:22,777 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 175 transitions. [2025-02-08 07:41:22,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-02-08 07:41:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 175 transitions. [2025-02-08 07:41:22,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:41:22,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:22,777 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:22,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 07:41:22,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:22,978 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:22,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:22,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1862155867, now seen corresponding path program 1 times [2025-02-08 07:41:22,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:22,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666611427] [2025-02-08 07:41:22,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:22,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:22,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:22,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:22,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 07:41:23,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:41:23,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:41:23,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:23,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:23,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 07:41:23,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:23,588 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-02-08 07:41:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:23,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:23,924 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:23,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666611427] [2025-02-08 07:41:23,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666611427] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:23,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:41:23,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-02-08 07:41:23,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013352265] [2025-02-08 07:41:23,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:23,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 07:41:23,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:23,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 07:41:23,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:41:23,925 INFO L87 Difference]: Start difference. First operand 160 states and 175 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:25,490 INFO L93 Difference]: Finished difference Result 164 states and 179 transitions. [2025-02-08 07:41:25,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:41:25,491 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 07:41:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:25,492 INFO L225 Difference]: With dead ends: 164 [2025-02-08 07:41:25,492 INFO L226 Difference]: Without dead ends: 164 [2025-02-08 07:41:25,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-08 07:41:25,493 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 8 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:25,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 676 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 07:41:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-08 07:41:25,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-02-08 07:41:25,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 97 states have (on average 1.824742268041237) internal successors, (177), 161 states have internal predecessors, (177), 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-02-08 07:41:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 179 transitions. [2025-02-08 07:41:25,503 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 179 transitions. Word has length 8 [2025-02-08 07:41:25,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:25,503 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 179 transitions. [2025-02-08 07:41:25,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:25,503 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 179 transitions. [2025-02-08 07:41:25,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 07:41:25,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:25,504 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:25,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 07:41:25,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:25,704 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:25,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:25,705 INFO L85 PathProgramCache]: Analyzing trace with hash 777060999, now seen corresponding path program 1 times [2025-02-08 07:41:25,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:25,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [957215486] [2025-02-08 07:41:25,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:25,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:25,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:25,707 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:25,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 07:41:25,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 07:41:26,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 07:41:26,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:26,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:26,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 07:41:26,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:26,424 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-02-08 07:41:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:26,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:26,857 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:26,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957215486] [2025-02-08 07:41:26,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957215486] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:26,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:41:26,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2025-02-08 07:41:26,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851227363] [2025-02-08 07:41:26,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:26,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:41:26,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:26,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:41:26,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:41:26,859 INFO L87 Difference]: Start difference. First operand 164 states and 179 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:41:28,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:28,115 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2025-02-08 07:41:28,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 07:41:28,116 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-02-08 07:41:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:28,117 INFO L225 Difference]: With dead ends: 179 [2025-02-08 07:41:28,117 INFO L226 Difference]: Without dead ends: 179 [2025-02-08 07:41:28,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2025-02-08 07:41:28,118 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 35 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:28,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 738 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 07:41:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-08 07:41:28,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-02-08 07:41:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 112 states have (on average 1.7142857142857142) internal successors, (192), 176 states have internal predecessors, (192), 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-02-08 07:41:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2025-02-08 07:41:28,127 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 20 [2025-02-08 07:41:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:28,128 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2025-02-08 07:41:28,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:41:28,128 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2025-02-08 07:41:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 07:41:28,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:28,128 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:28,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 07:41:28,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:28,329 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:28,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:28,329 INFO L85 PathProgramCache]: Analyzing trace with hash 268283014, now seen corresponding path program 2 times [2025-02-08 07:41:28,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:28,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1854894779] [2025-02-08 07:41:28,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:41:28,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:28,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:28,332 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:28,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 07:41:28,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 07:41:28,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 35 statements. [2025-02-08 07:41:28,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:41:28,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:29,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 07:41:29,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:29,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:29,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2025-02-08 07:41:29,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-08 07:41:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 07:41:29,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:41:29,101 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:29,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854894779] [2025-02-08 07:41:29,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854894779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:29,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:29,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:41:29,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290016375] [2025-02-08 07:41:29,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:29,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:41:29,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:29,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:41:29,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:41:29,102 INFO L87 Difference]: Start difference. First operand 179 states and 194 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-08 07:41:29,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:29,761 INFO L93 Difference]: Finished difference Result 269 states and 298 transitions. [2025-02-08 07:41:29,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:41:29,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 35 [2025-02-08 07:41:29,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:29,763 INFO L225 Difference]: With dead ends: 269 [2025-02-08 07:41:29,763 INFO L226 Difference]: Without dead ends: 269 [2025-02-08 07:41:29,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:41:29,763 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 242 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:29,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 499 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 07:41:29,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-08 07:41:29,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 178. [2025-02-08 07:41:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 112 states have (on average 1.7053571428571428) internal successors, (191), 175 states have internal predecessors, (191), 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-02-08 07:41:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2025-02-08 07:41:29,768 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 35 [2025-02-08 07:41:29,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:29,768 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2025-02-08 07:41:29,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-08 07:41:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2025-02-08 07:41:29,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 07:41:29,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:29,768 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:29,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 07:41:29,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:29,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:29,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:29,969 INFO L85 PathProgramCache]: Analyzing trace with hash 268283013, now seen corresponding path program 1 times [2025-02-08 07:41:29,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:29,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1884171305] [2025-02-08 07:41:29,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:29,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:29,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:29,973 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:29,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 07:41:30,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 07:41:30,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 07:41:30,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:30,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:30,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 07:41:30,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:30,682 INFO L349 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2025-02-08 07:41:30,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2025-02-08 07:41:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 07:41:30,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:41:30,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:30,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884171305] [2025-02-08 07:41:30,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884171305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:30,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:30,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:41:30,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357254324] [2025-02-08 07:41:30,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:30,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:30,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:30,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:30,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:30,689 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:30,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:30,908 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2025-02-08 07:41:30,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:30,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-02-08 07:41:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:30,909 INFO L225 Difference]: With dead ends: 189 [2025-02-08 07:41:30,909 INFO L226 Difference]: Without dead ends: 189 [2025-02-08 07:41:30,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:30,910 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 132 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:30,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 134 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:41:30,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-08 07:41:30,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 173. [2025-02-08 07:41:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 112 states have (on average 1.6607142857142858) internal successors, (186), 170 states have internal predecessors, (186), 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-02-08 07:41:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 188 transitions. [2025-02-08 07:41:30,914 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 188 transitions. Word has length 35 [2025-02-08 07:41:30,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:30,915 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 188 transitions. [2025-02-08 07:41:30,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:30,915 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 188 transitions. [2025-02-08 07:41:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 07:41:30,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:30,915 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:30,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 07:41:31,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:31,116 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:31,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:31,117 INFO L85 PathProgramCache]: Analyzing trace with hash -514660280, now seen corresponding path program 1 times [2025-02-08 07:41:31,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:31,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [148531564] [2025-02-08 07:41:31,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:31,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:31,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:31,119 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:31,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 07:41:31,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 07:41:31,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 07:41:31,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:31,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:31,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 07:41:31,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:31,824 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-02-08 07:41:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:32,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:33,822 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:33,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148531564] [2025-02-08 07:41:33,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148531564] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:33,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:41:33,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2025-02-08 07:41:33,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939325156] [2025-02-08 07:41:33,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:33,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 07:41:33,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:33,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 07:41:33,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2025-02-08 07:41:33,823 INFO L87 Difference]: Start difference. First operand 173 states and 188 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 24 states have internal predecessors, (67), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:41:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:38,783 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2025-02-08 07:41:38,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 07:41:38,784 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 24 states have internal predecessors, (67), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-02-08 07:41:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:38,784 INFO L225 Difference]: With dead ends: 203 [2025-02-08 07:41:38,784 INFO L226 Difference]: Without dead ends: 203 [2025-02-08 07:41:38,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=354, Invalid=836, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 07:41:38,785 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 61 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:38,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1288 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-08 07:41:38,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-08 07:41:38,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-02-08 07:41:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 142 states have (on average 1.528169014084507) internal successors, (217), 200 states have internal predecessors, (217), 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-02-08 07:41:38,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 219 transitions. [2025-02-08 07:41:38,789 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 219 transitions. Word has length 38 [2025-02-08 07:41:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:38,789 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 219 transitions. [2025-02-08 07:41:38,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 24 states have internal predecessors, (67), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:41:38,790 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 219 transitions. [2025-02-08 07:41:38,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 07:41:38,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:38,790 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:38,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 07:41:38,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:38,991 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:38,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:38,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1781644312, now seen corresponding path program 2 times [2025-02-08 07:41:38,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:38,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1266491441] [2025-02-08 07:41:38,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:41:38,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:38,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:38,994 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:38,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 07:41:39,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 07:41:39,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-02-08 07:41:39,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:41:39,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:39,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 07:41:39,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:39,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:39,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2025-02-08 07:41:39,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-08 07:41:39,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:39,894 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 19 treesize of output 14 [2025-02-08 07:41:39,917 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-08 07:41:39,918 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-02-08 07:41:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:40,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:41:40,001 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:40,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266491441] [2025-02-08 07:41:40,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266491441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:40,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:40,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 07:41:40,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961876304] [2025-02-08 07:41:40,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:40,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 07:41:40,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:40,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 07:41:40,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:41:40,003 INFO L87 Difference]: Start difference. First operand 203 states and 219 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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-02-08 07:41:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:41,453 INFO L93 Difference]: Finished difference Result 232 states and 251 transitions. [2025-02-08 07:41:41,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:41:41,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 44 [2025-02-08 07:41:41,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:41,454 INFO L225 Difference]: With dead ends: 232 [2025-02-08 07:41:41,454 INFO L226 Difference]: Without dead ends: 232 [2025-02-08 07:41:41,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:41:41,455 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 339 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:41,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 347 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 07:41:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-08 07:41:41,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 217. [2025-02-08 07:41:41,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 156 states have (on average 1.5256410256410255) internal successors, (238), 214 states have internal predecessors, (238), 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-02-08 07:41:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 240 transitions. [2025-02-08 07:41:41,459 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 240 transitions. Word has length 44 [2025-02-08 07:41:41,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:41,459 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 240 transitions. [2025-02-08 07:41:41,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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-02-08 07:41:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 240 transitions. [2025-02-08 07:41:41,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 07:41:41,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:41,460 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:41,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 07:41:41,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:41,661 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:41,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:41,661 INFO L85 PathProgramCache]: Analyzing trace with hash 240347648, now seen corresponding path program 1 times [2025-02-08 07:41:41,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:41,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1494241971] [2025-02-08 07:41:41,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:41,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:41,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:41,663 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:41,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 07:41:41,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 07:41:42,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 07:41:42,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:42,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:42,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 07:41:42,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:42,342 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-02-08 07:41:42,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:42,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2025-02-08 07:41:42,370 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-08 07:41:42,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2025-02-08 07:41:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:42,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:41:42,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:42,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494241971] [2025-02-08 07:41:42,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494241971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:42,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:42,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:41:42,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053712009] [2025-02-08 07:41:42,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:42,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:42,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:42,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:42,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:42,388 INFO L87 Difference]: Start difference. First operand 217 states and 240 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 07:41:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:42,618 INFO L93 Difference]: Finished difference Result 222 states and 247 transitions. [2025-02-08 07:41:42,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:42,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 47 [2025-02-08 07:41:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:42,620 INFO L225 Difference]: With dead ends: 222 [2025-02-08 07:41:42,620 INFO L226 Difference]: Without dead ends: 222 [2025-02-08 07:41:42,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:42,620 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 125 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:42,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 132 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:41:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-08 07:41:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2025-02-08 07:41:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 161 states have (on average 1.5217391304347827) internal successors, (245), 218 states have internal predecessors, (245), 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-02-08 07:41:42,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 247 transitions. [2025-02-08 07:41:42,624 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 247 transitions. Word has length 47 [2025-02-08 07:41:42,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:42,624 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 247 transitions. [2025-02-08 07:41:42,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 07:41:42,624 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 247 transitions. [2025-02-08 07:41:42,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 07:41:42,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:42,625 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:42,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 07:41:42,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:42,825 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:42,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:42,826 INFO L85 PathProgramCache]: Analyzing trace with hash 240347649, now seen corresponding path program 1 times [2025-02-08 07:41:42,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:42,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117542436] [2025-02-08 07:41:42,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:42,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:42,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:42,828 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:42,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 07:41:42,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 07:41:43,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 07:41:43,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:43,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:43,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 07:41:43,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:43,562 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 11 treesize of output 10 [2025-02-08 07:41:43,568 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-02-08 07:41:43,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:43,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-02-08 07:41:43,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:43,663 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 19 treesize of output 14 [2025-02-08 07:41:43,670 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-08 07:41:43,671 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-02-08 07:41:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:43,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:41:43,773 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:43,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117542436] [2025-02-08 07:41:43,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117542436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:43,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:43,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 07:41:43,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38473101] [2025-02-08 07:41:43,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:43,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 07:41:43,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:43,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 07:41:43,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:41:43,774 INFO L87 Difference]: Start difference. First operand 221 states and 247 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-02-08 07:41:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:45,185 INFO L93 Difference]: Finished difference Result 231 states and 252 transitions. [2025-02-08 07:41:45,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:41:45,185 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 47 [2025-02-08 07:41:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:45,186 INFO L225 Difference]: With dead ends: 231 [2025-02-08 07:41:45,186 INFO L226 Difference]: Without dead ends: 231 [2025-02-08 07:41:45,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:41:45,187 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 186 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:45,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 345 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 07:41:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-08 07:41:45,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2025-02-08 07:41:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 161 states have (on average 1.515527950310559) internal successors, (244), 218 states have internal predecessors, (244), 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-02-08 07:41:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 246 transitions. [2025-02-08 07:41:45,190 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 246 transitions. Word has length 47 [2025-02-08 07:41:45,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:45,191 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 246 transitions. [2025-02-08 07:41:45,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-02-08 07:41:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 246 transitions. [2025-02-08 07:41:45,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 07:41:45,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:45,191 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:45,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 07:41:45,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:45,392 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:45,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:45,392 INFO L85 PathProgramCache]: Analyzing trace with hash 486524448, now seen corresponding path program 1 times [2025-02-08 07:41:45,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:45,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1869141118] [2025-02-08 07:41:45,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:45,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:45,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:45,395 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:45,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 07:41:45,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 07:41:45,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 07:41:45,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:45,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:45,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 07:41:46,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:46,004 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-02-08 07:41:46,026 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 25 treesize of output 1 [2025-02-08 07:41:46,056 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 29 treesize of output 11 [2025-02-08 07:41:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:46,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:41:46,065 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:46,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869141118] [2025-02-08 07:41:46,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869141118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:46,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:46,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:41:46,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072835871] [2025-02-08 07:41:46,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:46,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:41:46,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:46,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:41:46,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:41:46,066 INFO L87 Difference]: Start difference. First operand 221 states and 246 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-02-08 07:41:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:46,598 INFO L93 Difference]: Finished difference Result 220 states and 244 transitions. [2025-02-08 07:41:46,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:41:46,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 50 [2025-02-08 07:41:46,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:46,599 INFO L225 Difference]: With dead ends: 220 [2025-02-08 07:41:46,599 INFO L226 Difference]: Without dead ends: 220 [2025-02-08 07:41:46,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:41:46,599 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:46,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 427 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 07:41:46,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-08 07:41:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-02-08 07:41:46,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 161 states have (on average 1.5031055900621118) internal successors, (242), 217 states have internal predecessors, (242), 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-02-08 07:41:46,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 244 transitions. [2025-02-08 07:41:46,612 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 244 transitions. Word has length 50 [2025-02-08 07:41:46,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:46,612 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 244 transitions. [2025-02-08 07:41:46,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-02-08 07:41:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 244 transitions. [2025-02-08 07:41:46,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 07:41:46,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:46,613 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:46,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 07:41:46,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:46,813 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:46,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:46,814 INFO L85 PathProgramCache]: Analyzing trace with hash 486524449, now seen corresponding path program 1 times [2025-02-08 07:41:46,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:46,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [953355669] [2025-02-08 07:41:46,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:46,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:46,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:46,816 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:46,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 07:41:46,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 07:41:47,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 07:41:47,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:47,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:47,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 07:41:47,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:47,458 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-02-08 07:41:47,477 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 16 treesize of output 12 [2025-02-08 07:41:47,492 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 25 treesize of output 1 [2025-02-08 07:41:47,542 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 27 treesize of output 9 [2025-02-08 07:41:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:47,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:41:47,561 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:47,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953355669] [2025-02-08 07:41:47,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953355669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:47,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:47,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:41:47,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726330225] [2025-02-08 07:41:47,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:47,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:41:47,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:47,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:41:47,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:41:47,562 INFO L87 Difference]: Start difference. First operand 220 states and 244 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-02-08 07:41:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:48,210 INFO L93 Difference]: Finished difference Result 219 states and 242 transitions. [2025-02-08 07:41:48,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:41:48,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 50 [2025-02-08 07:41:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:48,212 INFO L225 Difference]: With dead ends: 219 [2025-02-08 07:41:48,212 INFO L226 Difference]: Without dead ends: 219 [2025-02-08 07:41:48,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:41:48,212 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 11 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:48,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 450 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 07:41:48,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-08 07:41:48,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-02-08 07:41:48,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 216 states have internal predecessors, (240), 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-02-08 07:41:48,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 242 transitions. [2025-02-08 07:41:48,217 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 242 transitions. Word has length 50 [2025-02-08 07:41:48,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:48,217 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 242 transitions. [2025-02-08 07:41:48,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-02-08 07:41:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 242 transitions. [2025-02-08 07:41:48,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 07:41:48,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:48,218 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:48,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 07:41:48,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:48,419 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:48,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:48,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1842801108, now seen corresponding path program 1 times [2025-02-08 07:41:48,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:48,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1043772244] [2025-02-08 07:41:48,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:48,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:48,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:48,422 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:48,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 07:41:48,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 07:41:49,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 07:41:49,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:49,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:49,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 07:41:49,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:49,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:41:49,095 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:49,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043772244] [2025-02-08 07:41:49,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043772244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:49,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:49,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:41:49,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683668916] [2025-02-08 07:41:49,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:49,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:49,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:49,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:49,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:49,096 INFO L87 Difference]: Start difference. First operand 219 states and 242 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-02-08 07:41:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:49,166 INFO L93 Difference]: Finished difference Result 231 states and 257 transitions. [2025-02-08 07:41:49,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:49,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 54 [2025-02-08 07:41:49,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:49,169 INFO L225 Difference]: With dead ends: 231 [2025-02-08 07:41:49,169 INFO L226 Difference]: Without dead ends: 231 [2025-02-08 07:41:49,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:49,170 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 6 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:49,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 315 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-08 07:41:49,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2025-02-08 07:41:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 163 states have (on average 1.4846625766871167) internal successors, (242), 218 states have internal predecessors, (242), 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-02-08 07:41:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 244 transitions. [2025-02-08 07:41:49,174 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 244 transitions. Word has length 54 [2025-02-08 07:41:49,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:49,174 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 244 transitions. [2025-02-08 07:41:49,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-02-08 07:41:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 244 transitions. [2025-02-08 07:41:49,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 07:41:49,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:49,175 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 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] [2025-02-08 07:41:49,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 07:41:49,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:49,376 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:49,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:49,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1292506038, now seen corresponding path program 1 times [2025-02-08 07:41:49,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:49,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [631918669] [2025-02-08 07:41:49,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:49,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:49,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:49,379 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:49,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 07:41:49,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 07:41:49,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 07:41:49,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:49,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:49,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 07:41:50,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:50,046 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 29 treesize of output 11 [2025-02-08 07:41:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:50,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:41:50,058 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:50,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631918669] [2025-02-08 07:41:50,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631918669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:50,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:50,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:41:50,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133831467] [2025-02-08 07:41:50,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:50,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:41:50,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:50,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:41:50,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:41:50,059 INFO L87 Difference]: Start difference. First operand 221 states and 244 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-02-08 07:41:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:50,641 INFO L93 Difference]: Finished difference Result 220 states and 242 transitions. [2025-02-08 07:41:50,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:41:50,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 55 [2025-02-08 07:41:50,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:50,644 INFO L225 Difference]: With dead ends: 220 [2025-02-08 07:41:50,644 INFO L226 Difference]: Without dead ends: 220 [2025-02-08 07:41:50,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:41:50,644 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 5 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:50,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 471 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 07:41:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-08 07:41:50,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-02-08 07:41:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 163 states have (on average 1.4723926380368098) internal successors, (240), 217 states have internal predecessors, (240), 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-02-08 07:41:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2025-02-08 07:41:50,648 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 55 [2025-02-08 07:41:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:50,649 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2025-02-08 07:41:50,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-02-08 07:41:50,649 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2025-02-08 07:41:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 07:41:50,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:50,650 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 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] [2025-02-08 07:41:50,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-08 07:41:50,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:50,851 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:50,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:50,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1292506039, now seen corresponding path program 1 times [2025-02-08 07:41:50,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:50,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [736336734] [2025-02-08 07:41:50,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:50,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:50,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:50,854 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:50,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 07:41:50,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 07:41:51,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 07:41:51,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:51,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:51,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 07:41:51,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:51,508 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-02-08 07:41:51,528 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 25 treesize of output 1 [2025-02-08 07:41:51,534 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 16 treesize of output 12 [2025-02-08 07:41:51,651 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 27 treesize of output 9 [2025-02-08 07:41:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:51,673 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:41:51,674 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:51,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736336734] [2025-02-08 07:41:51,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736336734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:51,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:51,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:41:51,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158855162] [2025-02-08 07:41:51,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:51,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:41:51,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:51,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:41:51,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:41:51,675 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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-02-08 07:41:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:52,402 INFO L93 Difference]: Finished difference Result 228 states and 251 transitions. [2025-02-08 07:41:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:41:52,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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 55 [2025-02-08 07:41:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:52,403 INFO L225 Difference]: With dead ends: 228 [2025-02-08 07:41:52,403 INFO L226 Difference]: Without dead ends: 228 [2025-02-08 07:41:52,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:41:52,404 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 14 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:52,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 444 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 07:41:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-08 07:41:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2025-02-08 07:41:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 169 states have (on average 1.4615384615384615) internal successors, (247), 223 states have internal predecessors, (247), 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-02-08 07:41:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 249 transitions. [2025-02-08 07:41:52,409 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 249 transitions. Word has length 55 [2025-02-08 07:41:52,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:52,409 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 249 transitions. [2025-02-08 07:41:52,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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-02-08 07:41:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 249 transitions. [2025-02-08 07:41:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 07:41:52,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:52,409 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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-02-08 07:41:52,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-08 07:41:52,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:52,610 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:52,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:52,611 INFO L85 PathProgramCache]: Analyzing trace with hash -835689197, now seen corresponding path program 1 times [2025-02-08 07:41:52,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:52,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1760810499] [2025-02-08 07:41:52,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:52,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:52,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:52,613 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:52,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 07:41:52,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 07:41:53,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 07:41:53,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:53,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:53,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:41:53,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:53,357 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:53,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:53,383 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:53,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760810499] [2025-02-08 07:41:53,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760810499] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:53,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:41:53,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-02-08 07:41:53,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700991206] [2025-02-08 07:41:53,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:53,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:41:53,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:53,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:41:53,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:41:53,384 INFO L87 Difference]: Start difference. First operand 226 states and 249 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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-02-08 07:41:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:53,509 INFO L93 Difference]: Finished difference Result 253 states and 279 transitions. [2025-02-08 07:41:53,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:41:53,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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 59 [2025-02-08 07:41:53,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:53,510 INFO L225 Difference]: With dead ends: 253 [2025-02-08 07:41:53,510 INFO L226 Difference]: Without dead ends: 253 [2025-02-08 07:41:53,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:41:53,511 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 19 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:53,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 474 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:53,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-08 07:41:53,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2025-02-08 07:41:53,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 193 states have (on average 1.4352331606217616) internal successors, (277), 247 states have internal predecessors, (277), 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-02-08 07:41:53,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 279 transitions. [2025-02-08 07:41:53,515 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 279 transitions. Word has length 59 [2025-02-08 07:41:53,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:53,515 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 279 transitions. [2025-02-08 07:41:53,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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-02-08 07:41:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 279 transitions. [2025-02-08 07:41:53,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-08 07:41:53,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:53,521 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 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] [2025-02-08 07:41:53,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:53,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:53,721 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:53,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash -136314792, now seen corresponding path program 1 times [2025-02-08 07:41:53,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:53,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [572277374] [2025-02-08 07:41:53,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:53,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:53,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:53,724 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:53,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-08 07:41:53,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 07:41:54,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 07:41:54,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:54,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:54,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 07:41:54,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:54,453 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-02-08 07:41:54,466 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 25 treesize of output 1 [2025-02-08 07:41:54,471 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 16 treesize of output 12 [2025-02-08 07:41:54,655 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 27 treesize of output 9 [2025-02-08 07:41:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:54,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:55,494 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:41:55,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572277374] [2025-02-08 07:41:55,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572277374] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:55,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:41:55,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-08 07:41:55,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337467597] [2025-02-08 07:41:55,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:55,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 07:41:55,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:41:55,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 07:41:55,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-08 07:41:55,495 INFO L87 Difference]: Start difference. First operand 250 states and 279 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 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-02-08 07:41:58,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:58,790 INFO L93 Difference]: Finished difference Result 249 states and 273 transitions. [2025-02-08 07:41:58,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 07:41:58,791 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 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 60 [2025-02-08 07:41:58,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:58,792 INFO L225 Difference]: With dead ends: 249 [2025-02-08 07:41:58,792 INFO L226 Difference]: Without dead ends: 249 [2025-02-08 07:41:58,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-02-08 07:41:58,793 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 17 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:58,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 928 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-08 07:41:58,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-08 07:41:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2025-02-08 07:41:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 193 states have (on average 1.4041450777202074) internal successors, (271), 246 states have internal predecessors, (271), 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-02-08 07:41:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 273 transitions. [2025-02-08 07:41:58,796 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 273 transitions. Word has length 60 [2025-02-08 07:41:58,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:58,797 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 273 transitions. [2025-02-08 07:41:58,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 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-02-08 07:41:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 273 transitions. [2025-02-08 07:41:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 07:41:58,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:58,797 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:58,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-08 07:41:58,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:58,998 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-08 07:41:58,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:58,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1935118484, now seen corresponding path program 2 times [2025-02-08 07:41:58,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:41:58,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1154690884] [2025-02-08 07:41:58,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:41:58,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:58,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:59,001 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:59,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-08 07:41:59,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-02-08 07:42:00,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 07:42:00,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:42:00,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:00,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 07:42:00,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:42:00,106 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-02-08 07:42:00,132 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 25 treesize of output 1 [2025-02-08 07:42:00,137 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 16 treesize of output 12 [2025-02-08 07:42:00,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 27 treesize of output 9 [2025-02-08 07:42:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:00,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:42:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:02,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:42:02,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154690884] [2025-02-08 07:42:02,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154690884] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:42:02,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:42:02,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2025-02-08 07:42:02,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219478290] [2025-02-08 07:42:02,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:42:02,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 07:42:02,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:42:02,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 07:42:02,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-02-08 07:42:02,417 INFO L87 Difference]: Start difference. First operand 249 states and 273 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 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)