./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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/loop-industry-pattern/aiob_4.c.v+lhb-reducer.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 de5a591efb40e891e226106d8590a7409596f3a27aca8b697af826abd4fe5201 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:44:02,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:44:03,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:44:03,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:44:03,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:44:03,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:44:03,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:44:03,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:44:03,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:44:03,023 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:44:03,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:44:03,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:44:03,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:44:03,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:44:03,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:44:03,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:44:03,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:44:03,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:44:03,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:44:03,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:44:03,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:44:03,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:44:03,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:44:03,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:44:03,028 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 -> de5a591efb40e891e226106d8590a7409596f3a27aca8b697af826abd4fe5201 [2025-02-06 10:44:03,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:44:03,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:44:03,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:44:03,287 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:44:03,287 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:44:03,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c [2025-02-06 10:44:04,507 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/669bb8847/03badaa8c6d74a59b1750d08e83d524d/FLAGdaac202e3 [2025-02-06 10:44:04,765 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:44:04,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c [2025-02-06 10:44:04,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/669bb8847/03badaa8c6d74a59b1750d08e83d524d/FLAGdaac202e3 [2025-02-06 10:44:05,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/669bb8847/03badaa8c6d74a59b1750d08e83d524d [2025-02-06 10:44:05,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:44:05,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:44:05,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:44:05,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:44:05,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:44:05,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:44:05" (1/1) ... [2025-02-06 10:44:05,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c9112d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:05, skipping insertion in model container [2025-02-06 10:44:05,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:44:05" (1/1) ... [2025-02-06 10:44:05,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:44:05,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:44:05,313 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:44:05,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:44:05,374 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:44:05,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:05 WrapperNode [2025-02-06 10:44:05,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:44:05,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:44:05,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:44:05,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:44:05,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:05" (1/1) ... [2025-02-06 10:44:05,394 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:05" (1/1) ... [2025-02-06 10:44:05,419 INFO L138 Inliner]: procedures = 18, calls = 293, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 835 [2025-02-06 10:44:05,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:44:05,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:44:05,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:44:05,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:44:05,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:05" (1/1) ... [2025-02-06 10:44:05,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:05" (1/1) ... [2025-02-06 10:44:05,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:05" (1/1) ... [2025-02-06 10:44:05,472 INFO L175 MemorySlicer]: Split 189 memory accesses to 5 slices as follows [2, 7, 2, 137, 41]. 72 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 7, 2, 0, 0]. The 127 writes are split as follows [0, 0, 0, 127, 0]. [2025-02-06 10:44:05,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:05" (1/1) ... [2025-02-06 10:44:05,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:05" (1/1) ... [2025-02-06 10:44:05,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:05" (1/1) ... [2025-02-06 10:44:05,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:05" (1/1) ... [2025-02-06 10:44:05,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:05" (1/1) ... [2025-02-06 10:44:05,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:05" (1/1) ... [2025-02-06 10:44:05,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:44:05,499 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:44:05,499 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:44:05,499 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:44:05,500 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:05" (1/1) ... [2025-02-06 10:44:05,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:44:05,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:44:05,545 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-06 10:44:05,548 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-06 10:44:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:44:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:44:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:44:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 10:44:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 10:44:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:44:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:44:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:44:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:44:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 10:44:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 10:44:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 10:44:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 10:44:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 10:44:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 10:44:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 10:44:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:44:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:44:05,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:44:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:44:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:44:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 10:44:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 10:44:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 10:44:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:44:05,694 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:44:05,696 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:44:12,206 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L441: havoc main_~Id_MCDC_89____CPAchecker_TMP_2~9#1;havoc main_~__tmp_11~0#1, main_~__VERIFIER_assert__Id_MCDC_92~9#1; [2025-02-06 10:44:12,207 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L408: havoc main_~Id_MCDC_89____CPAchecker_TMP_2~8#1, main_~Id_MCDC_89____CPAchecker_TMP_0~9#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~9#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~9#1;havoc main_~__tmp_10~0#1, main_~__VERIFIER_assert__Id_MCDC_92~8#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~7#1, main_~Id_MCDC_89____CPAchecker_TMP_0~8#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~8#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~8#1;havoc main_~__tmp_9~0#1, main_~__VERIFIER_assert__Id_MCDC_92~7#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~6#1, main_~Id_MCDC_89____CPAchecker_TMP_0~7#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~7#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~7#1;havoc main_~__tmp_8~0#1, main_~__VERIFIER_assert__Id_MCDC_92~6#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~5#1, main_~Id_MCDC_89____CPAchecker_TMP_0~6#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~6#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~6#1;havoc main_~__tmp_7~0#1, main_~__VERIFIER_assert__Id_MCDC_92~5#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~4#1, main_~Id_MCDC_89____CPAchecker_TMP_0~5#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~5#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~5#1;havoc main_~__tmp_6~0#1, main_~__VERIFIER_assert__Id_MCDC_92~4#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~3#1, main_~Id_MCDC_89____CPAchecker_TMP_0~4#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~4#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~4#1;havoc main_~__tmp_5~0#1, main_~__VERIFIER_assert__Id_MCDC_92~3#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~2#1, main_~Id_MCDC_89____CPAchecker_TMP_0~3#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~3#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~3#1;havoc main_~__tmp_4~0#1, main_~__VERIFIER_assert__Id_MCDC_92~2#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~1#1, main_~Id_MCDC_89____CPAchecker_TMP_0~2#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~2#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~2#1;havoc main_~__tmp_3~0#1, main_~__VERIFIER_assert__Id_MCDC_92~1#1;havoc main_~Id_MCDC_89____CPAchecker_TMP_2~0#1, main_~Id_MCDC_89____CPAchecker_TMP_0~1#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~1#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~1#1;havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__Id_MCDC_92~0#1;call ULTIMATE.dealloc(main_~#Id_MCDC_89__Id_MCDC_95~0#1.base, main_~#Id_MCDC_89__Id_MCDC_95~0#1.offset);havoc main_~#Id_MCDC_89__Id_MCDC_95~0#1.base, main_~#Id_MCDC_89__Id_MCDC_95~0#1.offset;havoc main_~__tmp_1~0#1.base, main_~__tmp_1~0#1.offset, main_~Id_MCDC_89__Id_MCDC_88~0#1.base, main_~Id_MCDC_89__Id_MCDC_88~0#1.offset, main_~Id_MCDC_89__Id_MCDC_94~0#1.base, main_~Id_MCDC_89__Id_MCDC_94~0#1.offset, main_~#Id_MCDC_89__Id_MCDC_95~0#1.base, main_~#Id_MCDC_89__Id_MCDC_95~0#1.offset, main_~Id_MCDC_89__Id_MCDC_96~0#1, main_~Id_MCDC_89____CPAchecker_TMP_0~0#1.base, main_~Id_MCDC_89____CPAchecker_TMP_0~0#1.offset, main_~Id_MCDC_89____CPAchecker_TMP_1~0#1;call ULTIMATE.dealloc(main_~#main__Id_MCDC_119~0#1.base, main_~#main__Id_MCDC_119~0#1.offset);havoc main_~#main__Id_MCDC_119~0#1.base, main_~#main__Id_MCDC_119~0#1.offset; [2025-02-06 10:44:12,207 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L460: havoc main_~__tmp_12~0#1, main_~__VERIFIER_assert__Id_MCDC_92~10#1; [2025-02-06 10:44:12,254 INFO L? ?]: Removed 328 outVars from TransFormulas that were not future-live. [2025-02-06 10:44:12,254 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:44:12,266 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:44:12,267 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:44:12,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:44:12 BoogieIcfgContainer [2025-02-06 10:44:12,267 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:44:12,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:44:12,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:44:12,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:44:12,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:44:05" (1/3) ... [2025-02-06 10:44:12,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601dd0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:44:12, skipping insertion in model container [2025-02-06 10:44:12,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:05" (2/3) ... [2025-02-06 10:44:12,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601dd0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:44:12, skipping insertion in model container [2025-02-06 10:44:12,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:44:12" (3/3) ... [2025-02-06 10:44:12,274 INFO L128 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+lhb-reducer.c [2025-02-06 10:44:12,284 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:44:12,285 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aiob_4.c.v+lhb-reducer.c that has 1 procedures, 246 locations, 1 initial locations, 0 loop locations, and 104 error locations. [2025-02-06 10:44:12,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:44:12,320 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;@359f4588, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:44:12,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2025-02-06 10:44:12,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 246 states, 141 states have (on average 2.0354609929078014) internal successors, (287), 245 states have internal predecessors, (287), 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-06 10:44:12,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:44:12,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:12,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:44:12,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-06 10:44:12,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:12,330 INFO L85 PathProgramCache]: Analyzing trace with hash 12343326, now seen corresponding path program 1 times [2025-02-06 10:44:12,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:12,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170136317] [2025-02-06 10:44:12,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:12,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:12,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:44:12,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:44:12,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:12,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:13,080 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-06 10:44:13,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:13,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170136317] [2025-02-06 10:44:13,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170136317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:13,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:13,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:13,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906566443] [2025-02-06 10:44:13,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:13,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:44:13,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:13,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:44:13,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:44:13,110 INFO L87 Difference]: Start difference. First operand has 246 states, 141 states have (on average 2.0354609929078014) internal successors, (287), 245 states have internal predecessors, (287), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:18,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:44:22,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:44:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:24,648 INFO L93 Difference]: Finished difference Result 204 states and 234 transitions. [2025-02-06 10:44:24,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:44:24,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 10:44:24,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:24,656 INFO L225 Difference]: With dead ends: 204 [2025-02-06 10:44:24,656 INFO L226 Difference]: Without dead ends: 202 [2025-02-06 10:44:24,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:44:24,658 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 277 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:24,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 155 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 265 Invalid, 2 Unknown, 0 Unchecked, 11.4s Time] [2025-02-06 10:44:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-06 10:44:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-06 10:44:24,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 139 states have (on average 1.669064748201439) internal successors, (232), 201 states have internal predecessors, (232), 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-06 10:44:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 232 transitions. [2025-02-06 10:44:24,702 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 232 transitions. Word has length 4 [2025-02-06 10:44:24,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:24,702 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 232 transitions. [2025-02-06 10:44:24,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 232 transitions. [2025-02-06 10:44:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:44:24,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:24,703 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:44:24,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:44:24,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-06 10:44:24,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash 12343327, now seen corresponding path program 1 times [2025-02-06 10:44:24,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:24,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663257359] [2025-02-06 10:44:24,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:24,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:24,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:44:24,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:44:24,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:24,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:25,194 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-06 10:44:25,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:25,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663257359] [2025-02-06 10:44:25,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663257359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:25,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:25,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:25,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2868584] [2025-02-06 10:44:25,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:25,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:44:25,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:25,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:44:25,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:44:25,196 INFO L87 Difference]: Start difference. First operand 202 states and 232 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:30,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:44:34,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:44:35,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:35,764 INFO L93 Difference]: Finished difference Result 161 states and 191 transitions. [2025-02-06 10:44:35,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:44:35,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 10:44:35,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:35,766 INFO L225 Difference]: With dead ends: 161 [2025-02-06 10:44:35,768 INFO L226 Difference]: Without dead ends: 161 [2025-02-06 10:44:35,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:44:35,769 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 80 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:35,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 328 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 161 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2025-02-06 10:44:35,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-06 10:44:35,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-02-06 10:44:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 139 states have (on average 1.3741007194244603) internal successors, (191), 160 states have internal predecessors, (191), 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-06 10:44:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 191 transitions. [2025-02-06 10:44:35,776 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 191 transitions. Word has length 4 [2025-02-06 10:44:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:35,776 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 191 transitions. [2025-02-06 10:44:35,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 191 transitions. [2025-02-06 10:44:35,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:44:35,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:35,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:44:35,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:44:35,776 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-06 10:44:35,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:35,777 INFO L85 PathProgramCache]: Analyzing trace with hash 12331677, now seen corresponding path program 1 times [2025-02-06 10:44:35,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:35,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17569867] [2025-02-06 10:44:35,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:35,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:35,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:44:35,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:44:35,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:35,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:35,972 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-06 10:44:35,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:35,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17569867] [2025-02-06 10:44:35,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17569867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:35,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:35,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:35,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886276933] [2025-02-06 10:44:35,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:35,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:44:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:35,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:44:35,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:44:35,974 INFO L87 Difference]: Start difference. First operand 161 states and 191 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:41,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:44:45,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:44:49,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:44:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:51,189 INFO L93 Difference]: Finished difference Result 162 states and 191 transitions. [2025-02-06 10:44:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:44:51,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 10:44:51,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:51,192 INFO L225 Difference]: With dead ends: 162 [2025-02-06 10:44:51,192 INFO L226 Difference]: Without dead ends: 161 [2025-02-06 10:44:51,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:44:51,192 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 82 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:51,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 295 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 3 Unknown, 0 Unchecked, 15.2s Time] [2025-02-06 10:44:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-06 10:44:51,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-02-06 10:44:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 139 states have (on average 1.3669064748201438) internal successors, (190), 160 states have internal predecessors, (190), 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-06 10:44:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 190 transitions. [2025-02-06 10:44:51,205 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 190 transitions. Word has length 4 [2025-02-06 10:44:51,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:51,205 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 190 transitions. [2025-02-06 10:44:51,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:51,205 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 190 transitions. [2025-02-06 10:44:51,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 10:44:51,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:51,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:51,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:44:51,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-06 10:44:51,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:51,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1184846909, now seen corresponding path program 1 times [2025-02-06 10:44:51,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:51,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552784828] [2025-02-06 10:44:51,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:51,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:55,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 10:44:55,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 10:44:55,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:55,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:55,693 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-06 10:44:55,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:55,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552784828] [2025-02-06 10:44:55,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552784828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:55,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:55,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:55,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469220624] [2025-02-06 10:44:55,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:55,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:55,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:55,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:55,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:55,695 INFO L87 Difference]: Start difference. First operand 161 states and 190 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-06 10:44:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:56,149 INFO L93 Difference]: Finished difference Result 163 states and 190 transitions. [2025-02-06 10:44:56,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:56,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 88 [2025-02-06 10:44:56,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:56,151 INFO L225 Difference]: With dead ends: 163 [2025-02-06 10:44:56,151 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 10:44:56,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:56,151 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 91 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:56,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 247 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:44:56,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 10:44:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2025-02-06 10:44:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 139 states have (on average 1.3597122302158273) internal successors, (189), 160 states have internal predecessors, (189), 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-06 10:44:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2025-02-06 10:44:56,159 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 88 [2025-02-06 10:44:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:56,159 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2025-02-06 10:44:56,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-06 10:44:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2025-02-06 10:44:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 10:44:56,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:56,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:56,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:44:56,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-06 10:44:56,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:56,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1924447200, now seen corresponding path program 1 times [2025-02-06 10:44:56,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:56,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188039499] [2025-02-06 10:44:56,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:56,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:59,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 10:44:59,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 10:44:59,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:59,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:00,066 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-06 10:45:00,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:00,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188039499] [2025-02-06 10:45:00,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188039499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:45:00,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:45:00,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:45:00,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071975748] [2025-02-06 10:45:00,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:45:00,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:45:00,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:00,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:45:00,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:45:00,067 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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-06 10:45:05,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:45:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:07,199 INFO L93 Difference]: Finished difference Result 160 states and 188 transitions. [2025-02-06 10:45:07,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:45:07,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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 89 [2025-02-06 10:45:07,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:07,201 INFO L225 Difference]: With dead ends: 160 [2025-02-06 10:45:07,201 INFO L226 Difference]: Without dead ends: 160 [2025-02-06 10:45:07,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:45:07,201 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 71 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:07,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 254 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2025-02-06 10:45:07,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-06 10:45:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-06 10:45:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 139 states have (on average 1.3525179856115108) internal successors, (188), 159 states have internal predecessors, (188), 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-06 10:45:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 188 transitions. [2025-02-06 10:45:07,213 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 188 transitions. Word has length 89 [2025-02-06 10:45:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:07,213 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 188 transitions. [2025-02-06 10:45:07,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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-06 10:45:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 188 transitions. [2025-02-06 10:45:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 10:45:07,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:07,216 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:45:07,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:45:07,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-06 10:45:07,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:07,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1924447199, now seen corresponding path program 1 times [2025-02-06 10:45:07,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:07,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159897944] [2025-02-06 10:45:07,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:07,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:10,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 10:45:10,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 10:45:10,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:10,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:12,080 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-06 10:45:12,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:12,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159897944] [2025-02-06 10:45:12,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159897944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:45:12,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:45:12,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:45:12,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87346967] [2025-02-06 10:45:12,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:45:12,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:45:12,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:12,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:45:12,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:45:12,083 INFO L87 Difference]: Start difference. First operand 160 states and 188 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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-06 10:45:17,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:45:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:20,650 INFO L93 Difference]: Finished difference Result 159 states and 187 transitions. [2025-02-06 10:45:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:45:20,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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 89 [2025-02-06 10:45:20,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:20,652 INFO L225 Difference]: With dead ends: 159 [2025-02-06 10:45:20,652 INFO L226 Difference]: Without dead ends: 159 [2025-02-06 10:45:20,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:45:20,653 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 112 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:20,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 307 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 314 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2025-02-06 10:45:20,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-06 10:45:20,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-02-06 10:45:20,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 139 states have (on average 1.3453237410071943) internal successors, (187), 158 states have internal predecessors, (187), 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-06 10:45:20,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 187 transitions. [2025-02-06 10:45:20,667 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 187 transitions. Word has length 89 [2025-02-06 10:45:20,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:20,667 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 187 transitions. [2025-02-06 10:45:20,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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-06 10:45:20,667 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 187 transitions. [2025-02-06 10:45:20,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 10:45:20,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:20,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:45:20,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:45:20,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-06 10:45:20,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:20,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1924453189, now seen corresponding path program 1 times [2025-02-06 10:45:20,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:20,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782799052] [2025-02-06 10:45:20,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:20,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:24,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 10:45:24,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 10:45:24,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:24,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:24,764 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-06 10:45:24,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:24,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782799052] [2025-02-06 10:45:24,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782799052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:45:24,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:45:24,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:45:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669645723] [2025-02-06 10:45:24,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:45:24,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:45:24,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:24,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:45:24,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:45:24,765 INFO L87 Difference]: Start difference. First operand 159 states and 187 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-06 10:45:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:24,809 INFO L93 Difference]: Finished difference Result 159 states and 186 transitions. [2025-02-06 10:45:24,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:45:24,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 89 [2025-02-06 10:45:24,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:24,810 INFO L225 Difference]: With dead ends: 159 [2025-02-06 10:45:24,810 INFO L226 Difference]: Without dead ends: 159 [2025-02-06 10:45:24,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:45:24,811 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:24,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 368 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:45:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-06 10:45:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-02-06 10:45:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 158 states have internal predecessors, (186), 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-06 10:45:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 186 transitions. [2025-02-06 10:45:24,816 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 186 transitions. Word has length 89 [2025-02-06 10:45:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:24,816 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 186 transitions. [2025-02-06 10:45:24,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-06 10:45:24,816 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 186 transitions. [2025-02-06 10:45:24,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 10:45:24,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:24,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:45:24,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:45:24,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-06 10:45:24,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:24,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1737150337, now seen corresponding path program 1 times [2025-02-06 10:45:24,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:24,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949718237] [2025-02-06 10:45:24,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:24,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:28,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 10:45:28,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 10:45:28,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:28,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:33,447 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-06 10:45:33,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:33,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949718237] [2025-02-06 10:45:33,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949718237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:45:33,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:45:33,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:45:33,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52401517] [2025-02-06 10:45:33,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:45:33,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:45:33,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:33,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:45:33,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:45:33,448 INFO L87 Difference]: Start difference. First operand 159 states and 186 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-06 10:45:37,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:45:39,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:39,331 INFO L93 Difference]: Finished difference Result 159 states and 185 transitions. [2025-02-06 10:45:39,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:45:39,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 91 [2025-02-06 10:45:39,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:39,334 INFO L225 Difference]: With dead ends: 159 [2025-02-06 10:45:39,337 INFO L226 Difference]: Without dead ends: 159 [2025-02-06 10:45:39,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:45:39,339 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 2 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:39,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 645 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2025-02-06 10:45:39,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-06 10:45:39,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-02-06 10:45:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 139 states have (on average 1.330935251798561) internal successors, (185), 158 states have internal predecessors, (185), 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-06 10:45:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 185 transitions. [2025-02-06 10:45:39,343 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 185 transitions. Word has length 91 [2025-02-06 10:45:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:39,343 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 185 transitions. [2025-02-06 10:45:39,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-06 10:45:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 185 transitions. [2025-02-06 10:45:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-06 10:45:39,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:39,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:45:39,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:45:39,345 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2025-02-06 10:45:39,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:39,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1340679418, now seen corresponding path program 1 times [2025-02-06 10:45:39,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:39,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668207577] [2025-02-06 10:45:39,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:39,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms