./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/test05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-regression/test05.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc3b64420d7066ddae343a06976c60db80b11c9064160fc3a579002ff9231727 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:19:50,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:19:50,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:19:50,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:19:50,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:19:50,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:19:50,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:19:50,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:19:50,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:19:50,159 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:19:50,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:19:50,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:19:50,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:19:50,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:19:50,160 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:19:50,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:19:50,161 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:19:50,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:19:50,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:19:50,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:19:50,161 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:19:50,162 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:19:50,162 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:19:50,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:19:50,162 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:19:50,162 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:19:50,162 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:19:50,162 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:19:50,162 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:19:50,162 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:19:50,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:19:50,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:19:50,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:19:50,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:19:50,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:19:50,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:19:50,163 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:19:50,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:19:50,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:19:50,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:19:50,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:19:50,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:19:50,164 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc3b64420d7066ddae343a06976c60db80b11c9064160fc3a579002ff9231727 [2025-02-08 06:19:50,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:19:50,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:19:50,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:19:50,477 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:19:50,478 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:19:50,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test05.c [2025-02-08 06:19:51,847 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a562bda70/e47db6fac2034a0a984b5e9374e15358/FLAG8fe7bbbb6 [2025-02-08 06:19:52,074 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:19:52,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/test05.c [2025-02-08 06:19:52,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a562bda70/e47db6fac2034a0a984b5e9374e15358/FLAG8fe7bbbb6 [2025-02-08 06:19:52,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a562bda70/e47db6fac2034a0a984b5e9374e15358 [2025-02-08 06:19:52,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:19:52,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:19:52,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:19:52,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:19:52,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:19:52,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:19:52" (1/1) ... [2025-02-08 06:19:52,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49329503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:52, skipping insertion in model container [2025-02-08 06:19:52,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:19:52" (1/1) ... [2025-02-08 06:19:52,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:19:52,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:19:52,324 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:19:52,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:19:52,356 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:19:52,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:52 WrapperNode [2025-02-08 06:19:52,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:19:52,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:19:52,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:19:52,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:19:52,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:52" (1/1) ... [2025-02-08 06:19:52,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:52" (1/1) ... [2025-02-08 06:19:52,392 INFO L138 Inliner]: procedures = 16, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 91 [2025-02-08 06:19:52,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:19:52,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:19:52,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:19:52,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:19:52,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:52" (1/1) ... [2025-02-08 06:19:52,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:52" (1/1) ... [2025-02-08 06:19:52,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:52" (1/1) ... [2025-02-08 06:19:52,424 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 3, 3, 9]. 53 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 8 writes are split as follows [0, 2, 1, 5]. [2025-02-08 06:19:52,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:52" (1/1) ... [2025-02-08 06:19:52,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:52" (1/1) ... [2025-02-08 06:19:52,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:52" (1/1) ... [2025-02-08 06:19:52,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:52" (1/1) ... [2025-02-08 06:19:52,442 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:52" (1/1) ... [2025-02-08 06:19:52,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:52" (1/1) ... [2025-02-08 06:19:52,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:19:52,449 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:19:52,449 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:19:52,450 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:19:52,450 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:52" (1/1) ... [2025-02-08 06:19:52,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:19:52,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:52,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:19:52,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:19:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:19:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:19:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:19:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 06:19:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:19:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:19:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:19:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:19:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 06:19:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:19:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:19:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:19:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:19:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 06:19:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:19:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:19:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:19:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 06:19:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:19:52,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:19:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:19:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:19:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:19:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 06:19:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:19:52,595 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:19:52,596 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:19:52,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L23: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#p1~0#1.base, main_~#p1~0#1.offset);havoc main_~#p1~0#1.base, main_~#p1~0#1.offset;call ULTIMATE.dealloc(main_~#p2~0#1.base, main_~#p2~0#1.offset);havoc main_~#p2~0#1.base, main_~#p2~0#1.offset; [2025-02-08 06:19:52,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: assume #valid == main_old_#valid#1;assume #valid == main_old_#valid#1;#t~ret13#1 := main_#res#1;havoc main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#p1~0#1.base, main_~#p1~0#1.offset, main_~#p2~0#1.base, main_~#p2~0#1.offset;assume { :end_inline_main } true; [2025-02-08 06:19:52,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: assume !(#valid == main_old_#valid#1); [2025-02-08 06:19:52,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L40: assume 0 != main_#t~mem12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1; [2025-02-08 06:19:52,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L40: assume !(0 != main_#t~mem12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;main_#res#1 := 0;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#p1~0#1.base, main_~#p1~0#1.offset);havoc main_~#p1~0#1.base, main_~#p1~0#1.offset;call ULTIMATE.dealloc(main_~#p2~0#1.base, main_~#p2~0#1.offset);havoc main_~#p2~0#1.base, main_~#p2~0#1.offset; [2025-02-08 06:19:52,925 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L40-1: SUMMARY for call main_#t~mem12#1 := read~int#3(main_#t~mem11#1.base, main_#t~mem11#1.offset, 4); srcloc: null [2025-02-08 06:19:52,925 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L40-1: assume !(1 == #valid[main_#t~mem11#1.base]); [2025-02-08 06:19:52,925 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L40-1: assume !(4 + main_#t~mem11#1.offset <= #length[main_#t~mem11#1.base] && 0 <= main_#t~mem11#1.offset); [2025-02-08 06:19:52,925 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L40-2: SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~#p1~0#1.base, main_~#p1~0#1.offset, 4); srcloc: null [2025-02-08 06:19:52,926 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L40-2: assume !(1 == #valid[main_~#p1~0#1.base]); [2025-02-08 06:19:52,926 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L40-2: assume !(4 + main_~#p1~0#1.offset <= #length[main_~#p1~0#1.base] && 0 <= main_~#p1~0#1.offset); [2025-02-08 06:19:52,926 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: assume 1 != main_#t~mem10#1;havoc main_#t~mem10#1; [2025-02-08 06:19:52,926 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: assume !(1 != main_#t~mem10#1);havoc main_#t~mem10#1; [2025-02-08 06:19:52,926 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3: assume false;assume { :end_inline_reach_error } true;assume false;main_#res#1 := 1;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#p1~0#1.base, main_~#p1~0#1.offset);havoc main_~#p1~0#1.base, main_~#p1~0#1.offset;call ULTIMATE.dealloc(main_~#p2~0#1.base, main_~#p2~0#1.offset);havoc main_~#p2~0#1.base, main_~#p2~0#1.offset; [2025-02-08 06:19:52,926 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3: assume !false; [2025-02-08 06:19:52,926 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-1: SUMMARY for call main_#t~mem10#1 := read~int#3(main_~#a~0#1.base, main_~#a~0#1.offset, 4); srcloc: null [2025-02-08 06:19:52,927 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-1: assume !(1 == #valid[main_~#a~0#1.base]); [2025-02-08 06:19:52,927 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-1: assume !(4 + main_~#a~0#1.offset <= #length[main_~#a~0#1.base] && 0 <= main_~#a~0#1.offset); [2025-02-08 06:19:52,927 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-08 06:19:52,927 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46: assume { :begin_inline_reach_error } true; [2025-02-08 06:19:52,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: havoc main_#t~mem8#1;havoc main_#t~ret9#1; [2025-02-08 06:19:52,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-1: SUMMARY for call write~int#3(main_#t~ret9#1, main_~#a~0#1.base, main_~#a~0#1.offset, 4); srcloc: null [2025-02-08 06:19:52,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-1: assume !(1 == #valid[main_~#a~0#1.base]); [2025-02-08 06:19:52,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-1: assume !(4 + main_~#a~0#1.offset <= #length[main_~#a~0#1.base] && 0 <= main_~#a~0#1.offset); [2025-02-08 06:19:52,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-2: main_#t~ret9#1 := f_#res#1;havoc f_~a#1, f_~p1#1.base, f_~p1#1.offset, f_~p2#1.base, f_~p2#1.offset;havoc f_#in~a#1, f_#in~p1#1.base, f_#in~p1#1.offset, f_#in~p2#1.base, f_#in~p2#1.offset;assume { :end_inline_f } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647; [2025-02-08 06:19:52,944 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2025-02-08 06:19:52,944 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:19:52,956 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:19:52,957 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:19:52,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:19:52 BoogieIcfgContainer [2025-02-08 06:19:52,958 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:19:52,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:19:52,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:19:52,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:19:52,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:19:52" (1/3) ... [2025-02-08 06:19:52,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d1de86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:19:52, skipping insertion in model container [2025-02-08 06:19:52,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:52" (2/3) ... [2025-02-08 06:19:52,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d1de86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:19:52, skipping insertion in model container [2025-02-08 06:19:52,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:19:52" (3/3) ... [2025-02-08 06:19:52,967 INFO L128 eAbstractionObserver]: Analyzing ICFG test05.c [2025-02-08 06:19:52,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:19:52,984 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test05.c that has 1 procedures, 43 locations, 1 initial locations, 0 loop locations, and 32 error locations. [2025-02-08 06:19:53,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:19:53,040 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;@5a4bf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:19:53,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-02-08 06:19:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 19 states have (on average 2.210526315789474) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:53,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:19:53,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:53,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:19:53,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-08 06:19:53,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 3295, now seen corresponding path program 1 times [2025-02-08 06:19:53,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:53,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507443681] [2025-02-08 06:19:53,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:53,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:53,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:19:53,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:19:53,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:53,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:19:53,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:53,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507443681] [2025-02-08 06:19:53,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507443681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:53,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:53,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:19:53,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143578370] [2025-02-08 06:19:53,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:53,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:19:53,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:53,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:19:53,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:19:53,383 INFO L87 Difference]: Start difference. First operand has 42 states, 19 states have (on average 2.210526315789474) internal successors, (42), 41 states have internal predecessors, (42), 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) 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 06:19:53,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:53,449 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2025-02-08 06:19:53,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:19:53,451 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 06:19:53,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:53,457 INFO L225 Difference]: With dead ends: 41 [2025-02-08 06:19:53,457 INFO L226 Difference]: Without dead ends: 39 [2025-02-08 06:19:53,458 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 06:19:53,462 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:53,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 35 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:19:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-08 06:19:53,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-08 06:19:53,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 18 states have (on average 2.111111111111111) internal successors, (38), 38 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 38 transitions. [2025-02-08 06:19:53,500 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 38 transitions. Word has length 2 [2025-02-08 06:19:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:53,501 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 38 transitions. [2025-02-08 06:19:53,501 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 06:19:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 38 transitions. [2025-02-08 06:19:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:19:53,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:53,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:19:53,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:19:53,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-08 06:19:53,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:53,504 INFO L85 PathProgramCache]: Analyzing trace with hash 3296, now seen corresponding path program 1 times [2025-02-08 06:19:53,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:53,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405652030] [2025-02-08 06:19:53,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:53,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:53,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:19:53,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:19:53,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:53,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:19:53,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:53,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405652030] [2025-02-08 06:19:53,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405652030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:53,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:53,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:19:53,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011184008] [2025-02-08 06:19:53,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:53,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:19:53,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:53,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:19:53,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:19:53,692 INFO L87 Difference]: Start difference. First operand 39 states and 38 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 06:19:53,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:53,746 INFO L93 Difference]: Finished difference Result 38 states and 37 transitions. [2025-02-08 06:19:53,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:19:53,746 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 06:19:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:53,747 INFO L225 Difference]: With dead ends: 38 [2025-02-08 06:19:53,747 INFO L226 Difference]: Without dead ends: 38 [2025-02-08 06:19:53,747 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 06:19:53,748 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:53,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 30 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:19:53,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-08 06:19:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-08 06:19:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 37 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 37 transitions. [2025-02-08 06:19:53,752 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 37 transitions. Word has length 2 [2025-02-08 06:19:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:53,753 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 37 transitions. [2025-02-08 06:19:53,753 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 06:19:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 37 transitions. [2025-02-08 06:19:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:19:53,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:53,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:19:53,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:19:53,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-08 06:19:53,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:53,758 INFO L85 PathProgramCache]: Analyzing trace with hash 102182, now seen corresponding path program 1 times [2025-02-08 06:19:53,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:53,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732511513] [2025-02-08 06:19:53,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:53,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:53,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:19:53,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:19:53,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:53,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:19:53,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:53,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732511513] [2025-02-08 06:19:53,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732511513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:53,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:53,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:19:53,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485239631] [2025-02-08 06:19:53,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:53,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:19:53,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:53,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:19:53,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:19:53,840 INFO L87 Difference]: Start difference. First operand 38 states and 37 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:53,884 INFO L93 Difference]: Finished difference Result 37 states and 36 transitions. [2025-02-08 06:19:53,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:19:53,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 06:19:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:53,885 INFO L225 Difference]: With dead ends: 37 [2025-02-08 06:19:53,885 INFO L226 Difference]: Without dead ends: 37 [2025-02-08 06:19:53,886 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 06:19:53,886 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:53,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 29 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:19:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-08 06:19:53,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-08 06:19:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 18 states have (on average 2.0) internal successors, (36), 36 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 36 transitions. [2025-02-08 06:19:53,893 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 36 transitions. Word has length 3 [2025-02-08 06:19:53,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:53,893 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 36 transitions. [2025-02-08 06:19:53,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:53,893 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 36 transitions. [2025-02-08 06:19:53,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:19:53,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:53,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:19:53,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:19:53,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-08 06:19:53,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:53,896 INFO L85 PathProgramCache]: Analyzing trace with hash 102183, now seen corresponding path program 1 times [2025-02-08 06:19:53,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:53,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365745480] [2025-02-08 06:19:53,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:53,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:53,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:19:53,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:19:53,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:53,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:19:54,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:54,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365745480] [2025-02-08 06:19:54,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365745480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:54,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:54,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:19:54,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645382672] [2025-02-08 06:19:54,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:54,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:19:54,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:54,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:19:54,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:19:54,003 INFO L87 Difference]: Start difference. First operand 37 states and 36 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:54,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:54,051 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2025-02-08 06:19:54,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:19:54,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 06:19:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:54,052 INFO L225 Difference]: With dead ends: 36 [2025-02-08 06:19:54,052 INFO L226 Difference]: Without dead ends: 36 [2025-02-08 06:19:54,052 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 06:19:54,052 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:54,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 29 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:19:54,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-08 06:19:54,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-08 06:19:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 35 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 35 transitions. [2025-02-08 06:19:54,056 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 35 transitions. Word has length 3 [2025-02-08 06:19:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:54,056 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 35 transitions. [2025-02-08 06:19:54,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 35 transitions. [2025-02-08 06:19:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:19:54,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:54,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:19:54,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:19:54,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-08 06:19:54,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:54,058 INFO L85 PathProgramCache]: Analyzing trace with hash 3167676, now seen corresponding path program 1 times [2025-02-08 06:19:54,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:54,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763078270] [2025-02-08 06:19:54,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:54,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:54,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:19:54,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:19:54,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:54,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:19:54,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:54,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763078270] [2025-02-08 06:19:54,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763078270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:54,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:54,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:19:54,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773537868] [2025-02-08 06:19:54,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:54,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:19:54,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:54,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:19:54,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:19:54,185 INFO L87 Difference]: Start difference. First operand 36 states and 35 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:54,232 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2025-02-08 06:19:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:19:54,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 06:19:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:54,234 INFO L225 Difference]: With dead ends: 35 [2025-02-08 06:19:54,234 INFO L226 Difference]: Without dead ends: 35 [2025-02-08 06:19:54,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:19:54,235 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:54,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:19:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-08 06:19:54,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-08 06:19:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 34 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 34 transitions. [2025-02-08 06:19:54,241 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 34 transitions. Word has length 4 [2025-02-08 06:19:54,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:54,242 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 34 transitions. [2025-02-08 06:19:54,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2025-02-08 06:19:54,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:19:54,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:54,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:19:54,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:19:54,243 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-08 06:19:54,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:54,245 INFO L85 PathProgramCache]: Analyzing trace with hash 3167677, now seen corresponding path program 1 times [2025-02-08 06:19:54,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:54,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337125327] [2025-02-08 06:19:54,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:54,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:54,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:19:54,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:19:54,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:54,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:19:54,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:54,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337125327] [2025-02-08 06:19:54,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337125327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:54,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:54,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:19:54,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886783703] [2025-02-08 06:19:54,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:54,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:19:54,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:54,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:19:54,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:19:54,452 INFO L87 Difference]: Start difference. First operand 35 states and 34 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:54,491 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2025-02-08 06:19:54,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:19:54,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 06:19:54,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:54,492 INFO L225 Difference]: With dead ends: 34 [2025-02-08 06:19:54,493 INFO L226 Difference]: Without dead ends: 34 [2025-02-08 06:19:54,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 06:19:54,493 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:54,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:19:54,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-08 06:19:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-08 06:19:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 33 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 33 transitions. [2025-02-08 06:19:54,499 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 33 transitions. Word has length 4 [2025-02-08 06:19:54,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:54,499 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 33 transitions. [2025-02-08 06:19:54,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2025-02-08 06:19:54,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:19:54,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:54,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:19:54,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:19:54,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-08 06:19:54,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:54,500 INFO L85 PathProgramCache]: Analyzing trace with hash 98197987, now seen corresponding path program 1 times [2025-02-08 06:19:54,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:54,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536154744] [2025-02-08 06:19:54,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:54,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:54,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:19:54,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:19:54,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:54,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:19:54,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:54,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536154744] [2025-02-08 06:19:54,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536154744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:54,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:54,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:19:54,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510704309] [2025-02-08 06:19:54,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:54,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:19:54,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:54,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:19:54,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:19:54,678 INFO L87 Difference]: Start difference. First operand 34 states and 33 transitions. Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 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 06:19:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:54,733 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2025-02-08 06:19:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:19:54,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 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 06:19:54,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:54,734 INFO L225 Difference]: With dead ends: 30 [2025-02-08 06:19:54,735 INFO L226 Difference]: Without dead ends: 30 [2025-02-08 06:19:54,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:19:54,736 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:54,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 40 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:19:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-08 06:19:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-08 06:19:54,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 29 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 29 transitions. [2025-02-08 06:19:54,738 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 29 transitions. Word has length 5 [2025-02-08 06:19:54,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:54,738 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 29 transitions. [2025-02-08 06:19:54,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 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 06:19:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2025-02-08 06:19:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:19:54,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:54,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:19:54,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:19:54,740 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-08 06:19:54,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:54,740 INFO L85 PathProgramCache]: Analyzing trace with hash 98197988, now seen corresponding path program 1 times [2025-02-08 06:19:54,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:54,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089818807] [2025-02-08 06:19:54,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:54,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:54,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:19:54,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:19:54,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:54,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:19:54,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:54,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089818807] [2025-02-08 06:19:54,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089818807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:54,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:54,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:19:54,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565432931] [2025-02-08 06:19:54,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:54,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:19:54,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:54,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:19:54,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:19:54,902 INFO L87 Difference]: Start difference. First operand 30 states and 29 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:54,927 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2025-02-08 06:19:54,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:19:54,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:19:54,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:54,928 INFO L225 Difference]: With dead ends: 26 [2025-02-08 06:19:54,928 INFO L226 Difference]: Without dead ends: 26 [2025-02-08 06:19:54,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:19:54,929 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:54,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 26 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:19:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-08 06:19:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-08 06:19:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2025-02-08 06:19:54,933 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 5 [2025-02-08 06:19:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:54,933 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2025-02-08 06:19:54,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2025-02-08 06:19:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:19:54,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:54,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:54,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:19:54,934 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-08 06:19:54,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:54,935 INFO L85 PathProgramCache]: Analyzing trace with hash 230867805, now seen corresponding path program 1 times [2025-02-08 06:19:54,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:54,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930486577] [2025-02-08 06:19:54,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:54,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:54,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:19:54,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:19:54,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:54,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:19:55,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:55,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930486577] [2025-02-08 06:19:55,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930486577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:55,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:55,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:19:55,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998596871] [2025-02-08 06:19:55,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:55,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:19:55,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:55,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:19:55,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:19:55,070 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:55,123 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2025-02-08 06:19:55,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:19:55,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-08 06:19:55,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:55,124 INFO L225 Difference]: With dead ends: 24 [2025-02-08 06:19:55,124 INFO L226 Difference]: Without dead ends: 24 [2025-02-08 06:19:55,124 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 06:19:55,125 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:55,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 25 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:19:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-08 06:19:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-08 06:19:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 23 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:55,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2025-02-08 06:19:55,127 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 13 [2025-02-08 06:19:55,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:55,127 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2025-02-08 06:19:55,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:55,127 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2025-02-08 06:19:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:19:55,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:55,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:55,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:19:55,127 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-08 06:19:55,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:55,132 INFO L85 PathProgramCache]: Analyzing trace with hash 230867806, now seen corresponding path program 1 times [2025-02-08 06:19:55,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:55,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001462642] [2025-02-08 06:19:55,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:55,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:55,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:19:55,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:19:55,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:55,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:19:55,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:55,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001462642] [2025-02-08 06:19:55,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001462642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:55,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:55,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:19:55,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94566070] [2025-02-08 06:19:55,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:55,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:19:55,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:55,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:19:55,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:19:55,271 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:55,312 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2025-02-08 06:19:55,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:19:55,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-08 06:19:55,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:55,314 INFO L225 Difference]: With dead ends: 22 [2025-02-08 06:19:55,315 INFO L226 Difference]: Without dead ends: 22 [2025-02-08 06:19:55,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 06:19:55,315 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:55,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 25 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:19:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-08 06:19:55,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-08 06:19:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2025-02-08 06:19:55,317 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 13 [2025-02-08 06:19:55,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:55,317 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2025-02-08 06:19:55,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:55,317 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2025-02-08 06:19:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:19:55,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:55,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:55,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:19:55,322 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-08 06:19:55,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:55,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1540149676, now seen corresponding path program 1 times [2025-02-08 06:19:55,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:55,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774129861] [2025-02-08 06:19:55,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:55,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:55,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:19:55,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:19:55,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:55,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:19:55,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:55,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774129861] [2025-02-08 06:19:55,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774129861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:55,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:55,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:19:55,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863921112] [2025-02-08 06:19:55,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:55,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:19:55,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:55,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:19:55,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:19:55,441 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 06:19:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:55,480 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2025-02-08 06:19:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:19:55,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 16 [2025-02-08 06:19:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:55,481 INFO L225 Difference]: With dead ends: 21 [2025-02-08 06:19:55,481 INFO L226 Difference]: Without dead ends: 21 [2025-02-08 06:19:55,482 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 06:19:55,482 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:55,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:19:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-08 06:19:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-02-08 06:19:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2025-02-08 06:19:55,486 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 16 [2025-02-08 06:19:55,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:55,486 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2025-02-08 06:19:55,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 06:19:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2025-02-08 06:19:55,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:19:55,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:55,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:55,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:19:55,488 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-08 06:19:55,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:55,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1540149677, now seen corresponding path program 1 times [2025-02-08 06:19:55,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:55,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570465827] [2025-02-08 06:19:55,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:55,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:55,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:19:55,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:19:55,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:55,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:19:55,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:55,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570465827] [2025-02-08 06:19:55,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570465827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:55,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:55,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:19:55,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106172808] [2025-02-08 06:19:55,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:55,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:19:55,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:55,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:19:55,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:19:55,670 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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 06:19:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:55,709 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2025-02-08 06:19:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:19:55,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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 16 [2025-02-08 06:19:55,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:55,710 INFO L225 Difference]: With dead ends: 20 [2025-02-08 06:19:55,710 INFO L226 Difference]: Without dead ends: 20 [2025-02-08 06:19:55,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:19:55,711 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:55,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:19:55,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-08 06:19:55,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-08 06:19:55,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2025-02-08 06:19:55,712 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 16 [2025-02-08 06:19:55,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:55,712 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2025-02-08 06:19:55,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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 06:19:55,713 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2025-02-08 06:19:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 06:19:55,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:55,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:55,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:19:55,713 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-08 06:19:55,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:55,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1679878327, now seen corresponding path program 1 times [2025-02-08 06:19:55,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:55,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423368118] [2025-02-08 06:19:55,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:55,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:55,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 06:19:55,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 06:19:55,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:55,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:19:55,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:55,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423368118] [2025-02-08 06:19:55,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423368118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:55,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:55,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:19:55,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189072221] [2025-02-08 06:19:55,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:55,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:19:55,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:55,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:19:55,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:19:55,962 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:56,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:56,056 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2025-02-08 06:19:56,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:19:56,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-08 06:19:56,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:56,057 INFO L225 Difference]: With dead ends: 19 [2025-02-08 06:19:56,057 INFO L226 Difference]: Without dead ends: 19 [2025-02-08 06:19:56,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:19:56,058 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:56,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 22 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:19:56,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-08 06:19:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-08 06:19:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.0) internal successors, (18), 18 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2025-02-08 06:19:56,063 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 18 [2025-02-08 06:19:56,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:56,063 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2025-02-08 06:19:56,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2025-02-08 06:19:56,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 06:19:56,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:56,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:56,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:19:56,064 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-08 06:19:56,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1679878326, now seen corresponding path program 1 times [2025-02-08 06:19:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:56,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033420995] [2025-02-08 06:19:56,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:56,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:56,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 06:19:56,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 06:19:56,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:56,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:19:56,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:56,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033420995] [2025-02-08 06:19:56,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033420995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:56,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:56,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:19:56,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494050504] [2025-02-08 06:19:56,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:56,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:19:56,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:56,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:19:56,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:19:56,443 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:56,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:56,547 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2025-02-08 06:19:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:19:56,548 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-08 06:19:56,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:56,548 INFO L225 Difference]: With dead ends: 18 [2025-02-08 06:19:56,548 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:19:56,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:19:56,548 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:56,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 21 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:19:56,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:19:56,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:19:56,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:19:56,549 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2025-02-08 06:19:56,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:56,549 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:19:56,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:56,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:19:56,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:19:56,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (31 of 32 remaining) [2025-02-08 06:19:56,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (30 of 32 remaining) [2025-02-08 06:19:56,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 32 remaining) [2025-02-08 06:19:56,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 32 remaining) [2025-02-08 06:19:56,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 32 remaining) [2025-02-08 06:19:56,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 32 remaining) [2025-02-08 06:19:56,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 32 remaining) [2025-02-08 06:19:56,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 32 remaining) [2025-02-08 06:19:56,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2025-02-08 06:19:56,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2025-02-08 06:19:56,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2025-02-08 06:19:56,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2025-02-08 06:19:56,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 32 remaining) [2025-02-08 06:19:56,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2025-02-08 06:19:56,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2025-02-08 06:19:56,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2025-02-08 06:19:56,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 32 remaining) [2025-02-08 06:19:56,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2025-02-08 06:19:56,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2025-02-08 06:19:56,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2025-02-08 06:19:56,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2025-02-08 06:19:56,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 32 remaining) [2025-02-08 06:19:56,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2025-02-08 06:19:56,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2025-02-08 06:19:56,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2025-02-08 06:19:56,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2025-02-08 06:19:56,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2025-02-08 06:19:56,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2025-02-08 06:19:56,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2025-02-08 06:19:56,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2025-02-08 06:19:56,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 32 remaining) [2025-02-08 06:19:56,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 32 remaining) [2025-02-08 06:19:56,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:19:56,562 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:56,564 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:19:56,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:19:56 BoogieIcfgContainer [2025-02-08 06:19:56,567 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:19:56,568 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:19:56,568 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:19:56,568 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:19:56,569 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:19:52" (3/4) ... [2025-02-08 06:19:56,570 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:19:56,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-08 06:19:56,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 06:19:56,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 06:19:56,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:19:56,644 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:19:56,644 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:19:56,644 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:19:56,645 INFO L158 Benchmark]: Toolchain (without parser) took 4507.86ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.4MB in the beginning and 81.9MB in the end (delta: 31.6MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2025-02-08 06:19:56,646 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory was 123.6MB in the beginning and 123.3MB in the end (delta: 280.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:19:56,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.23ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 102.8MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:19:56,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.14ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 101.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:19:56,647 INFO L158 Benchmark]: Boogie Preprocessor took 55.48ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 99.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:19:56,647 INFO L158 Benchmark]: IcfgBuilder took 508.66ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 80.4MB in the end (delta: 19.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 06:19:56,647 INFO L158 Benchmark]: TraceAbstraction took 3607.47ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 79.9MB in the beginning and 87.6MB in the end (delta: -7.7MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2025-02-08 06:19:56,648 INFO L158 Benchmark]: Witness Printer took 76.26ms. Allocated memory is still 176.2MB. Free memory was 87.6MB in the beginning and 81.9MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:19:56,651 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.27ms. Allocated memory is still 201.3MB. Free memory was 123.6MB in the beginning and 123.3MB in the end (delta: 280.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.23ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 102.8MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.14ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 101.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.48ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 99.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 508.66ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 80.4MB in the end (delta: 19.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3607.47ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 79.9MB in the beginning and 87.6MB in the end (delta: -7.7MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * Witness Printer took 76.26ms. Allocated memory is still 176.2MB. Free memory was 87.6MB in the beginning and 81.9MB in the end (delta: 5.7MB). 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 - PositiveResult [Line: 22]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 408 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 174 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 549 IncrementalHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 234 mSDtfsCounter, 549 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 873 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:19:56,671 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 Writing output log to file Ultimate.log Result: TRUE