./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/test18.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/test18.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 0feebd8a64fe0b15b88b38240b283856fce37415e61ae67dd5b1ceb66f5c5fbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:19:58,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:19:58,618 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:58,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:19:58,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:19:58,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:19:58,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:19:58,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:19:58,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:19:58,646 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:19:58,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:19:58,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:19:58,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:19:58,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:19:58,648 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:19:58,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:19:58,648 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:19:58,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:19:58,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:19:58,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:19:58,649 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:19:58,649 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:19:58,649 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:19:58,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:19:58,649 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:19:58,649 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:19:58,649 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:19:58,649 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:19:58,649 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:19:58,649 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:19:58,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:19:58,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:19:58,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:19:58,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:19:58,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:19:58,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:19:58,650 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:19:58,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:19:58,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:19:58,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:19:58,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:19:58,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:19:58,650 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 -> 0feebd8a64fe0b15b88b38240b283856fce37415e61ae67dd5b1ceb66f5c5fbc [2025-02-08 06:19:58,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:19:58,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:19:58,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:19:58,868 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:19:58,868 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:19:58,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test18.c [2025-02-08 06:20:00,148 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58a639665/27905a19ad644ec8a311121b19974c01/FLAGa304e8f75 [2025-02-08 06:20:00,386 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:20:00,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/test18.c [2025-02-08 06:20:00,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58a639665/27905a19ad644ec8a311121b19974c01/FLAGa304e8f75 [2025-02-08 06:20:00,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58a639665/27905a19ad644ec8a311121b19974c01 [2025-02-08 06:20:00,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:20:00,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:20:00,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:20:00,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:20:00,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:20:00,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:20:00" (1/1) ... [2025-02-08 06:20:00,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7529c274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:00, skipping insertion in model container [2025-02-08 06:20:00,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:20:00" (1/1) ... [2025-02-08 06:20:00,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:20:00,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:20:00,884 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:20:00,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:20:00,909 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:20:00,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:00 WrapperNode [2025-02-08 06:20:00,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:20:00,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:20:00,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:20:00,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:20:00,915 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:20:00" (1/1) ... [2025-02-08 06:20:00,923 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:20:00" (1/1) ... [2025-02-08 06:20:00,937 INFO L138 Inliner]: procedures = 16, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 54 [2025-02-08 06:20:00,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:20:00,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:20:00,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:20:00,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:20:00,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:00" (1/1) ... [2025-02-08 06:20:00,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:00" (1/1) ... [2025-02-08 06:20:00,944 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:00" (1/1) ... [2025-02-08 06:20:00,957 INFO L175 MemorySlicer]: Split 9 memory accesses to 4 slices as follows [2, 2, 2, 3]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 2]. [2025-02-08 06:20:00,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:00" (1/1) ... [2025-02-08 06:20:00,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:00" (1/1) ... [2025-02-08 06:20:00,967 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:00" (1/1) ... [2025-02-08 06:20:00,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:00" (1/1) ... [2025-02-08 06:20:00,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:00" (1/1) ... [2025-02-08 06:20:00,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:00" (1/1) ... [2025-02-08 06:20:00,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:20:00,973 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:20:00,973 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:20:00,973 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:20:00,974 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:00" (1/1) ... [2025-02-08 06:20:00,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:20:00,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:20:01,009 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:20:01,018 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:20:01,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:20:01,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:20:01,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:20:01,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 06:20:01,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:20:01,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:20:01,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:20:01,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:20:01,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 06:20:01,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:20:01,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:20:01,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:20:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:20:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 06:20:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:20:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:20:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:20:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 06:20:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:20:01,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:20:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:20:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:20:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:20:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 06:20:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:20:01,106 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:20:01,108 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:20:01,276 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; [2025-02-08 06:20:01,276 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3: assume !false; [2025-02-08 06:20:01,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: assume { :begin_inline_reach_error } true; [2025-02-08 06:20:01,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: 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; [2025-02-08 06:20:01,285 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-02-08 06:20:01,285 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:20:01,291 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:20:01,291 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:20:01,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:20:01 BoogieIcfgContainer [2025-02-08 06:20:01,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:20:01,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:20:01,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:20:01,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:20:01,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:20:00" (1/3) ... [2025-02-08 06:20:01,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73549281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:20:01, skipping insertion in model container [2025-02-08 06:20:01,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:00" (2/3) ... [2025-02-08 06:20:01,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73549281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:20:01, skipping insertion in model container [2025-02-08 06:20:01,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:20:01" (3/3) ... [2025-02-08 06:20:01,298 INFO L128 eAbstractionObserver]: Analyzing ICFG test18.c [2025-02-08 06:20:01,308 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:20:01,310 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test18.c that has 1 procedures, 32 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-02-08 06:20:01,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:20:01,366 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;@eb56caa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:20:01,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 06:20:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 15 states have (on average 2.066666666666667) internal successors, (31), 31 states have internal predecessors, (31), 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:20:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:20:01,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:01,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:20:01,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:20:01,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:01,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2175, now seen corresponding path program 1 times [2025-02-08 06:20:01,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:01,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303433982] [2025-02-08 06:20:01,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:01,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:01,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:20:01,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:20:01,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:01,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:01,537 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:20:01,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:01,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303433982] [2025-02-08 06:20:01,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303433982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:01,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:01,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:20:01,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369553069] [2025-02-08 06:20:01,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:01,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:20:01,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:01,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:20:01,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:20:01,558 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 2.066666666666667) internal successors, (31), 31 states have internal predecessors, (31), 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:20:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:01,592 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2025-02-08 06:20:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:20:01,594 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:20:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:01,598 INFO L225 Difference]: With dead ends: 30 [2025-02-08 06:20:01,598 INFO L226 Difference]: Without dead ends: 27 [2025-02-08 06:20:01,599 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:20:01,601 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:01,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 17 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-08 06:20:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-08 06:20:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 26 states have internal predecessors, (26), 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:20:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2025-02-08 06:20:01,619 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 2 [2025-02-08 06:20:01,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:01,619 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2025-02-08 06:20:01,619 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:20:01,620 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2025-02-08 06:20:01,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:20:01,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:01,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:20:01,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:20:01,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:20:01,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:01,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2176, now seen corresponding path program 1 times [2025-02-08 06:20:01,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:01,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778661176] [2025-02-08 06:20:01,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:01,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:01,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:20:01,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:20:01,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:01,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:01,690 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:20:01,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:01,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778661176] [2025-02-08 06:20:01,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778661176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:01,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:01,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:20:01,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715431859] [2025-02-08 06:20:01,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:01,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:20:01,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:01,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:20:01,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:20:01,692 INFO L87 Difference]: Start difference. First operand 27 states and 26 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:20:01,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:01,713 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2025-02-08 06:20:01,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:20:01,714 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:20:01,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:01,714 INFO L225 Difference]: With dead ends: 25 [2025-02-08 06:20:01,714 INFO L226 Difference]: Without dead ends: 25 [2025-02-08 06:20:01,714 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:20:01,714 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:01,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 18 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-08 06:20:01,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-08 06:20:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 24 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2025-02-08 06:20:01,721 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 2 [2025-02-08 06:20:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:01,721 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2025-02-08 06:20:01,721 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:20:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2025-02-08 06:20:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:20:01,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:01,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:20:01,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:20:01,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:20:01,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:01,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2090300, now seen corresponding path program 1 times [2025-02-08 06:20:01,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:01,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214340763] [2025-02-08 06:20:01,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:01,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:01,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:20:01,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:20:01,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:01,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:01,791 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:20:01,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:01,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214340763] [2025-02-08 06:20:01,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214340763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:01,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:01,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:20:01,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115922882] [2025-02-08 06:20:01,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:01,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:20:01,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:01,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:20:01,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:20:01,792 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:01,814 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2025-02-08 06:20:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:20:01,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 06:20:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:01,815 INFO L225 Difference]: With dead ends: 24 [2025-02-08 06:20:01,815 INFO L226 Difference]: Without dead ends: 24 [2025-02-08 06:20:01,815 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:20:01,816 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 13 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:20:01,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 13 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:01,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-08 06:20:01,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-08 06:20:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.6428571428571428) 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:20:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2025-02-08 06:20:01,818 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 4 [2025-02-08 06:20:01,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:01,818 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2025-02-08 06:20:01,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2025-02-08 06:20:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:20:01,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:01,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:20:01,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:20:01,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:20:01,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:01,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2090301, now seen corresponding path program 1 times [2025-02-08 06:20:01,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:01,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768005611] [2025-02-08 06:20:01,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:01,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:01,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:20:01,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:20:01,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:01,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:01,925 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:20:01,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:01,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768005611] [2025-02-08 06:20:01,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768005611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:01,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:01,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:20:01,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790938171] [2025-02-08 06:20:01,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:01,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:20:01,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:01,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:20:01,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:20:01,926 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:01,946 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2025-02-08 06:20:01,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:20:01,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 06:20:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:01,947 INFO L225 Difference]: With dead ends: 23 [2025-02-08 06:20:01,947 INFO L226 Difference]: Without dead ends: 23 [2025-02-08 06:20:01,947 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:20:01,947 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:01,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:01,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-08 06:20:01,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-08 06:20:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 22 states have internal predecessors, (22), 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:20:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2025-02-08 06:20:01,949 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 4 [2025-02-08 06:20:01,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:01,949 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2025-02-08 06:20:01,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2025-02-08 06:20:01,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:20:01,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:01,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:20:01,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:20:01,950 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:20:01,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:01,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2008778297, now seen corresponding path program 1 times [2025-02-08 06:20:01,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:01,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306383190] [2025-02-08 06:20:01,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:01,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:01,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:20:01,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:20:01,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:01,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:02,022 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:20:02,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:02,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306383190] [2025-02-08 06:20:02,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306383190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:02,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:02,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:20:02,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627888295] [2025-02-08 06:20:02,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:02,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:20:02,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:02,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:20:02,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:20:02,024 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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:20:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:02,073 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2025-02-08 06:20:02,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:20:02,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2025-02-08 06:20:02,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:02,073 INFO L225 Difference]: With dead ends: 22 [2025-02-08 06:20:02,073 INFO L226 Difference]: Without dead ends: 22 [2025-02-08 06:20:02,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:20:02,074 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:02,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 15 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-08 06:20:02,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-08 06:20:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.5) 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:20:02,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2025-02-08 06:20:02,078 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 6 [2025-02-08 06:20:02,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:02,078 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2025-02-08 06:20:02,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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:20:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2025-02-08 06:20:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:20:02,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:02,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:20:02,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:20:02,079 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:20:02,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2008778298, now seen corresponding path program 1 times [2025-02-08 06:20:02,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:02,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102771196] [2025-02-08 06:20:02,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:02,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:02,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:20:02,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:20:02,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:02,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:02,154 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:20:02,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:02,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102771196] [2025-02-08 06:20:02,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102771196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:02,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:02,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:20:02,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075156691] [2025-02-08 06:20:02,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:02,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:20:02,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:02,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:20:02,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:20:02,156 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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:20:02,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:02,184 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2025-02-08 06:20:02,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:20:02,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2025-02-08 06:20:02,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:02,184 INFO L225 Difference]: With dead ends: 21 [2025-02-08 06:20:02,184 INFO L226 Difference]: Without dead ends: 21 [2025-02-08 06:20:02,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:20:02,185 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:02,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:02,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-08 06:20:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-02-08 06:20:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.4285714285714286) 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:20:02,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2025-02-08 06:20:02,187 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 6 [2025-02-08 06:20:02,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:02,187 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2025-02-08 06:20:02,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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:20:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2025-02-08 06:20:02,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:20:02,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:02,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:20:02,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:20:02,187 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:20:02,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:02,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2142585057, now seen corresponding path program 1 times [2025-02-08 06:20:02,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:02,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500971055] [2025-02-08 06:20:02,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:02,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:02,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:20:02,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:20:02,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:02,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:02,283 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:20:02,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:02,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500971055] [2025-02-08 06:20:02,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500971055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:02,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:02,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:20:02,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281648183] [2025-02-08 06:20:02,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:02,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:20:02,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:02,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:20:02,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:20:02,285 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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:20:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:02,318 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2025-02-08 06:20:02,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:20:02,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-02-08 06:20:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:02,318 INFO L225 Difference]: With dead ends: 20 [2025-02-08 06:20:02,318 INFO L226 Difference]: Without dead ends: 20 [2025-02-08 06:20:02,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:20:02,319 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:02,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-08 06:20:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-08 06:20:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.3571428571428572) 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:20:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2025-02-08 06:20:02,321 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 7 [2025-02-08 06:20:02,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:02,321 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2025-02-08 06:20:02,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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:20:02,321 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2025-02-08 06:20:02,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:20:02,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:02,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:20:02,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:20:02,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:20:02,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:02,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2142585058, now seen corresponding path program 1 times [2025-02-08 06:20:02,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:02,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398665495] [2025-02-08 06:20:02,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:02,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:02,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:20:02,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:20:02,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:02,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:02,453 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:20:02,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:02,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398665495] [2025-02-08 06:20:02,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398665495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:02,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:02,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:20:02,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300092061] [2025-02-08 06:20:02,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:02,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:20:02,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:02,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:20:02,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:20:02,454 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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:20:02,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:02,508 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2025-02-08 06:20:02,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:20:02,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2025-02-08 06:20:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:02,509 INFO L225 Difference]: With dead ends: 19 [2025-02-08 06:20:02,509 INFO L226 Difference]: Without dead ends: 19 [2025-02-08 06:20:02,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:20:02,510 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:02,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 24 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:02,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-08 06:20:02,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-08 06:20:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) 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:20:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2025-02-08 06:20:02,511 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 7 [2025-02-08 06:20:02,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:02,512 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2025-02-08 06:20:02,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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:20:02,512 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2025-02-08 06:20:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:20:02,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:02,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:20:02,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:20:02,512 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:20:02,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:02,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2052527115, now seen corresponding path program 1 times [2025-02-08 06:20:02,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:02,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116728762] [2025-02-08 06:20:02,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:02,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:02,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:20:02,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:20:02,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:02,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:02,801 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:20:02,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:02,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116728762] [2025-02-08 06:20:02,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116728762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:02,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:02,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:20:02,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613228245] [2025-02-08 06:20:02,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:02,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:20:02,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:02,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:20:02,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:20:02,803 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:02,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:02,866 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2025-02-08 06:20:02,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:20:02,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 06:20:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:02,866 INFO L225 Difference]: With dead ends: 18 [2025-02-08 06:20:02,866 INFO L226 Difference]: Without dead ends: 18 [2025-02-08 06:20:02,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:20:02,867 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:02,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:20:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-08 06:20:02,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-08 06:20:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 17 states have internal predecessors, (17), 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:20:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2025-02-08 06:20:02,869 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 10 [2025-02-08 06:20:02,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:02,869 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2025-02-08 06:20:02,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:02,869 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2025-02-08 06:20:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:20:02,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:02,869 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:20:02,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:20:02,870 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:20:02,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:02,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2052527114, now seen corresponding path program 1 times [2025-02-08 06:20:02,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:02,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295940559] [2025-02-08 06:20:02,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:02,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:02,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:20:02,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:20:02,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:02,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:03,213 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:20:03,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:03,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295940559] [2025-02-08 06:20:03,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295940559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:03,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:03,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:20:03,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489858182] [2025-02-08 06:20:03,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:03,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:20:03,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:03,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:20:03,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:20:03,215 INFO L87 Difference]: Start difference. First operand 18 states and 17 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:03,282 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2025-02-08 06:20:03,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:20:03,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 06:20:03,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:03,283 INFO L225 Difference]: With dead ends: 17 [2025-02-08 06:20:03,283 INFO L226 Difference]: Without dead ends: 17 [2025-02-08 06:20:03,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:20:03,284 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:03,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:20:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-08 06:20:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-02-08 06:20:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 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:20:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2025-02-08 06:20:03,287 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 10 [2025-02-08 06:20:03,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:03,287 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2025-02-08 06:20:03,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:03,287 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2025-02-08 06:20:03,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:20:03,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:03,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:20:03,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:20:03,288 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:20:03,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:03,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1088569102, now seen corresponding path program 1 times [2025-02-08 06:20:03,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:03,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668100069] [2025-02-08 06:20:03,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:03,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:03,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:20:03,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:20:03,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:03,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:03,609 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:20:03,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:03,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668100069] [2025-02-08 06:20:03,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668100069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:03,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:03,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:20:03,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926996947] [2025-02-08 06:20:03,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:03,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:20:03,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:03,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:20:03,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:20:03,611 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:03,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:03,759 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2025-02-08 06:20:03,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:20:03,759 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 06:20:03,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:03,760 INFO L225 Difference]: With dead ends: 16 [2025-02-08 06:20:03,760 INFO L226 Difference]: Without dead ends: 16 [2025-02-08 06:20:03,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:20:03,760 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:03,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 13 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:20:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-08 06:20:03,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-08 06:20:03,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:03,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2025-02-08 06:20:03,761 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 12 [2025-02-08 06:20:03,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:03,762 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2025-02-08 06:20:03,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2025-02-08 06:20:03,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:20:03,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:03,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:20:03,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:20:03,762 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:20:03,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:03,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1088569101, now seen corresponding path program 1 times [2025-02-08 06:20:03,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:03,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152284850] [2025-02-08 06:20:03,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:03,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:03,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:20:03,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:20:03,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:03,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:04,004 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:20:04,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:04,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152284850] [2025-02-08 06:20:04,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152284850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:04,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:04,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:20:04,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224151451] [2025-02-08 06:20:04,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:04,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:20:04,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:04,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:20:04,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:20:04,005 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:04,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:04,116 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2025-02-08 06:20:04,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:20:04,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 06:20:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:04,117 INFO L225 Difference]: With dead ends: 15 [2025-02-08 06:20:04,117 INFO L226 Difference]: Without dead ends: 15 [2025-02-08 06:20:04,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:20:04,117 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:04,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 15 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-08 06:20:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-08 06:20:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2025-02-08 06:20:04,118 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 12 [2025-02-08 06:20:04,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:04,119 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2025-02-08 06:20:04,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:04,119 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2025-02-08 06:20:04,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 06:20:04,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:04,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:20:04,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:20:04,119 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:20:04,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:04,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1857112614, now seen corresponding path program 1 times [2025-02-08 06:20:04,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:04,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56788126] [2025-02-08 06:20:04,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:04,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:04,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:20:04,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:20:04,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:04,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:04,495 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:20:04,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:04,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56788126] [2025-02-08 06:20:04,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56788126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:04,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:04,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:20:04,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889706533] [2025-02-08 06:20:04,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:04,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:20:04,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:04,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:20:04,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:20:04,496 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:04,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:04,552 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2025-02-08 06:20:04,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:20:04,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-08 06:20:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:04,552 INFO L225 Difference]: With dead ends: 14 [2025-02-08 06:20:04,552 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:20:04,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:20:04,553 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:04,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:20:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:20:04,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:20:04,553 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:20:04,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:20:04,553 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2025-02-08 06:20:04,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:04,554 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:20:04,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:20:04,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:20:04,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2025-02-08 06:20:04,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2025-02-08 06:20:04,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-02-08 06:20:04,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2025-02-08 06:20:04,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-02-08 06:20:04,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-02-08 06:20:04,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2025-02-08 06:20:04,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-02-08 06:20:04,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-02-08 06:20:04,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2025-02-08 06:20:04,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-02-08 06:20:04,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-02-08 06:20:04,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2025-02-08 06:20:04,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-02-08 06:20:04,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-02-08 06:20:04,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 16 remaining) [2025-02-08 06:20:04,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:20:04,559 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:20:04,561 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:20:04,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:20:04 BoogieIcfgContainer [2025-02-08 06:20:04,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:20:04,564 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:20:04,564 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:20:04,564 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:20:04,565 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:20:01" (3/4) ... [2025-02-08 06:20:04,566 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:20:04,573 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-02-08 06:20:04,573 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-08 06:20:04,573 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 06:20:04,573 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:20:04,645 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:20:04,645 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:20:04,645 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:20:04,646 INFO L158 Benchmark]: Toolchain (without parser) took 3904.76ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 115.1MB in the beginning and 95.1MB in the end (delta: 20.0MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2025-02-08 06:20:04,646 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:20:04,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.02ms. Allocated memory is still 142.6MB. Free memory was 115.1MB in the beginning and 104.3MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:20:04,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.00ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 103.3MB in the end (delta: 988.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:20:04,646 INFO L158 Benchmark]: Boogie Preprocessor took 34.47ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 101.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:20:04,647 INFO L158 Benchmark]: IcfgBuilder took 318.64ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 86.1MB in the end (delta: 15.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:20:04,647 INFO L158 Benchmark]: TraceAbstraction took 3270.27ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 85.2MB in the beginning and 99.2MB in the end (delta: -14.0MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2025-02-08 06:20:04,647 INFO L158 Benchmark]: Witness Printer took 81.55ms. Allocated memory is still 176.2MB. Free memory was 99.2MB in the beginning and 95.1MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:20:04,648 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.13ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.02ms. Allocated memory is still 142.6MB. Free memory was 115.1MB in the beginning and 104.3MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.00ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 103.3MB in the end (delta: 988.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.47ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 101.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 318.64ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 86.1MB in the end (delta: 15.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3270.27ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 85.2MB in the beginning and 99.2MB in the end (delta: -14.0MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Witness Printer took 81.55ms. Allocated memory is still 176.2MB. Free memory was 99.2MB in the beginning and 95.1MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. 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: 15]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 85 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 251 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 635 IncrementalHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 133 mSDtfsCounter, 635 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 1159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:20:04,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE