./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f54335276b565c52e40eef6a3f78ed9d794347e65877e7f862e4de86bcdea73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:25:12,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:25:13,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:25:13,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:25:13,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:25:13,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:25:13,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:25:13,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:25:13,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:25:13,039 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:25:13,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:25:13,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:25:13,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:25:13,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:25:13,040 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:25:13,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:25:13,040 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:25:13,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:25:13,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:25:13,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:25:13,041 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:25:13,041 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:25:13,041 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:25:13,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:25:13,041 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:25:13,041 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:25:13,041 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:25:13,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:25:13,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:25:13,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:25:13,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:25:13,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:25:13,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:25:13,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:25:13,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:25:13,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:25:13,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:25:13,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:25:13,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:25:13,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:25:13,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:25:13,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:25:13,043 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f54335276b565c52e40eef6a3f78ed9d794347e65877e7f862e4de86bcdea73 [2025-03-04 09:25:13,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:25:13,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:25:13,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:25:13,294 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:25:13,294 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:25:13,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i [2025-03-04 09:25:14,442 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/115807b95/bb6bbc823b4c49359ca4f2a5c1d8dca8/FLAG5c4db3a0e [2025-03-04 09:25:14,825 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:25:14,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i [2025-03-04 09:25:14,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/115807b95/bb6bbc823b4c49359ca4f2a5c1d8dca8/FLAG5c4db3a0e [2025-03-04 09:25:15,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/115807b95/bb6bbc823b4c49359ca4f2a5c1d8dca8 [2025-03-04 09:25:15,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:25:15,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:25:15,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:25:15,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:25:15,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:25:15,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:25:15" (1/1) ... [2025-03-04 09:25:15,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be58688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:15, skipping insertion in model container [2025-03-04 09:25:15,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:25:15" (1/1) ... [2025-03-04 09:25:15,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:25:15,507 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:25:15,521 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:25:15,524 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:25:15,527 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:25:15,530 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:25:15,546 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:25:15,547 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:25:15,548 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:25:15,548 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:25:15,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:25:15,561 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:25:15,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:25:15,696 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:25:15,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:15 WrapperNode [2025-03-04 09:25:15,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:25:15,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:25:15,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:25:15,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:25:15,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:15" (1/1) ... [2025-03-04 09:25:15,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:15" (1/1) ... [2025-03-04 09:25:15,842 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3254 [2025-03-04 09:25:15,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:25:15,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:25:15,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:25:15,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:25:15,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:15" (1/1) ... [2025-03-04 09:25:15,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:15" (1/1) ... [2025-03-04 09:25:15,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:15" (1/1) ... [2025-03-04 09:25:15,940 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-03-04 09:25:15,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:15" (1/1) ... [2025-03-04 09:25:15,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:15" (1/1) ... [2025-03-04 09:25:15,985 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:15" (1/1) ... [2025-03-04 09:25:15,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:15" (1/1) ... [2025-03-04 09:25:16,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:15" (1/1) ... [2025-03-04 09:25:16,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:15" (1/1) ... [2025-03-04 09:25:16,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:25:16,058 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:25:16,059 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:25:16,059 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:25:16,059 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:15" (1/1) ... [2025-03-04 09:25:16,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:25:16,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:16,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:25:16,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:25:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 09:25:16,106 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 09:25:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:25:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:25:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:25:16,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 09:25:16,107 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 09:25:16,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:25:16,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:25:16,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:25:16,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 09:25:16,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 09:25:16,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 09:25:16,108 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 09:25:16,108 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 09:25:16,108 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 09:25:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:25:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:25:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 09:25:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 09:25:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 09:25:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:25:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 09:25:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 09:25:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 09:25:16,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:25:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:25:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:25:16,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:25:16,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:25:16,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:25:16,248 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:25:16,251 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:25:18,679 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 09:25:18,874 INFO L? ?]: Removed 1537 outVars from TransFormulas that were not future-live. [2025-03-04 09:25:18,875 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:25:18,952 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:25:18,952 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 09:25:18,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:25:18 BoogieIcfgContainer [2025-03-04 09:25:18,953 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:25:18,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:25:18,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:25:18,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:25:18,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:25:15" (1/3) ... [2025-03-04 09:25:18,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffab1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:25:18, skipping insertion in model container [2025-03-04 09:25:18,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:15" (2/3) ... [2025-03-04 09:25:18,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffab1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:25:18, skipping insertion in model container [2025-03-04 09:25:18,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:25:18" (3/3) ... [2025-03-04 09:25:18,962 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test9-1.i [2025-03-04 09:25:18,973 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:25:18,975 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test9-1.i that has 6 procedures, 2071 locations, 1 initial locations, 31 loop locations, and 424 error locations. [2025-03-04 09:25:19,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:25:19,043 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;@3b6893b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:25:19,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2025-03-04 09:25:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 2061 states, 1131 states have (on average 2.0079575596816976) internal successors, (2271), 2054 states have internal predecessors, (2271), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2025-03-04 09:25:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:25:19,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:19,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:25:19,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:19,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:19,061 INFO L85 PathProgramCache]: Analyzing trace with hash 4321504, now seen corresponding path program 1 times [2025-03-04 09:25:19,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:19,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124342375] [2025-03-04 09:25:19,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:19,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:19,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:25:19,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:25:19,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:19,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:19,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:19,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124342375] [2025-03-04 09:25:19,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124342375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:19,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:19,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:25:19,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792985423] [2025-03-04 09:25:19,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:19,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:19,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:19,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:19,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:19,249 INFO L87 Difference]: Start difference. First operand has 2061 states, 1131 states have (on average 2.0079575596816976) internal successors, (2271), 2054 states have internal predecessors, (2271), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:20,629 INFO L93 Difference]: Finished difference Result 3810 states and 6136 transitions. [2025-03-04 09:25:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:20,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:25:20,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:20,663 INFO L225 Difference]: With dead ends: 3810 [2025-03-04 09:25:20,664 INFO L226 Difference]: Without dead ends: 3808 [2025-03-04 09:25:20,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:20,667 INFO L435 NwaCegarLoop]: 2884 mSDtfsCounter, 1904 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 5119 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:20,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2406 Valid, 5119 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 09:25:20,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3808 states. [2025-03-04 09:25:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3808 to 3544. [2025-03-04 09:25:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3544 states, 2122 states have (on average 1.937794533459001) internal successors, (4112), 3535 states have internal predecessors, (4112), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-03-04 09:25:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 3544 states and 6124 transitions. [2025-03-04 09:25:21,067 INFO L78 Accepts]: Start accepts. Automaton has 3544 states and 6124 transitions. Word has length 3 [2025-03-04 09:25:21,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:21,068 INFO L471 AbstractCegarLoop]: Abstraction has 3544 states and 6124 transitions. [2025-03-04 09:25:21,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:21,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3544 states and 6124 transitions. [2025-03-04 09:25:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:25:21,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:21,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:25:21,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:25:21,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:21,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash 4321503, now seen corresponding path program 1 times [2025-03-04 09:25:21,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:21,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551720321] [2025-03-04 09:25:21,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:21,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:21,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:25:21,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:25:21,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:21,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:21,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:21,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551720321] [2025-03-04 09:25:21,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551720321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:21,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:21,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:25:21,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417642069] [2025-03-04 09:25:21,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:21,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:21,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:21,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:21,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:21,107 INFO L87 Difference]: Start difference. First operand 3544 states and 6124 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:21,953 INFO L93 Difference]: Finished difference Result 3541 states and 6111 transitions. [2025-03-04 09:25:21,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:21,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:25:21,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:21,967 INFO L225 Difference]: With dead ends: 3541 [2025-03-04 09:25:21,967 INFO L226 Difference]: Without dead ends: 3541 [2025-03-04 09:25:21,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:21,968 INFO L435 NwaCegarLoop]: 2780 mSDtfsCounter, 2086 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2589 SdHoareTripleChecker+Valid, 2831 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:21,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2589 Valid, 2831 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 09:25:21,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2025-03-04 09:25:22,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 3541. [2025-03-04 09:25:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3541 states, 2130 states have (on average 1.924413145539906) internal successors, (4099), 3532 states have internal predecessors, (4099), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-03-04 09:25:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 6111 transitions. [2025-03-04 09:25:22,246 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 6111 transitions. Word has length 3 [2025-03-04 09:25:22,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:22,246 INFO L471 AbstractCegarLoop]: Abstraction has 3541 states and 6111 transitions. [2025-03-04 09:25:22,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:22,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 6111 transitions. [2025-03-04 09:25:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 09:25:22,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:22,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:22,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:25:22,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:22,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:22,247 INFO L85 PathProgramCache]: Analyzing trace with hash -72754185, now seen corresponding path program 1 times [2025-03-04 09:25:22,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:22,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432255543] [2025-03-04 09:25:22,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:22,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:22,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:25:22,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:25:22,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:22,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:22,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:22,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432255543] [2025-03-04 09:25:22,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432255543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:22,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:22,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:25:22,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159501702] [2025-03-04 09:25:22,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:22,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:22,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:22,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:22,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:22,384 INFO L87 Difference]: Start difference. First operand 3541 states and 6111 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:23,486 INFO L93 Difference]: Finished difference Result 6207 states and 11059 transitions. [2025-03-04 09:25:23,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:23,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 09:25:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:23,511 INFO L225 Difference]: With dead ends: 6207 [2025-03-04 09:25:23,511 INFO L226 Difference]: Without dead ends: 6207 [2025-03-04 09:25:23,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:23,512 INFO L435 NwaCegarLoop]: 5159 mSDtfsCounter, 1812 mSDsluCounter, 2464 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2312 SdHoareTripleChecker+Valid, 7623 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:23,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2312 Valid, 7623 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 09:25:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6207 states. [2025-03-04 09:25:23,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6207 to 3609. [2025-03-04 09:25:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3609 states, 2208 states have (on average 1.921195652173913) internal successors, (4242), 3600 states have internal predecessors, (4242), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-03-04 09:25:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 6254 transitions. [2025-03-04 09:25:23,918 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 6254 transitions. Word has length 8 [2025-03-04 09:25:23,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:23,918 INFO L471 AbstractCegarLoop]: Abstraction has 3609 states and 6254 transitions. [2025-03-04 09:25:23,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:23,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 6254 transitions. [2025-03-04 09:25:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 09:25:23,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:23,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:23,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:25:23,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:23,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:23,919 INFO L85 PathProgramCache]: Analyzing trace with hash -72754186, now seen corresponding path program 1 times [2025-03-04 09:25:23,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:23,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257690213] [2025-03-04 09:25:23,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:23,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:23,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:25:23,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:25:23,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:23,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:23,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:23,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257690213] [2025-03-04 09:25:23,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257690213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:23,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:23,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:25:23,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587871398] [2025-03-04 09:25:23,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:23,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:23,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:23,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:23,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:23,966 INFO L87 Difference]: Start difference. First operand 3609 states and 6254 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:24,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:24,867 INFO L93 Difference]: Finished difference Result 4870 states and 8562 transitions. [2025-03-04 09:25:24,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:24,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 09:25:24,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:24,886 INFO L225 Difference]: With dead ends: 4870 [2025-03-04 09:25:24,886 INFO L226 Difference]: Without dead ends: 4870 [2025-03-04 09:25:24,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:24,888 INFO L435 NwaCegarLoop]: 4950 mSDtfsCounter, 2071 mSDsluCounter, 2284 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2574 SdHoareTripleChecker+Valid, 7234 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:24,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2574 Valid, 7234 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 09:25:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2025-03-04 09:25:25,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 3562. [2025-03-04 09:25:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3562 states, 2208 states have (on average 1.8858695652173914) internal successors, (4164), 3553 states have internal predecessors, (4164), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-03-04 09:25:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3562 states to 3562 states and 6176 transitions. [2025-03-04 09:25:25,178 INFO L78 Accepts]: Start accepts. Automaton has 3562 states and 6176 transitions. Word has length 8 [2025-03-04 09:25:25,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:25,178 INFO L471 AbstractCegarLoop]: Abstraction has 3562 states and 6176 transitions. [2025-03-04 09:25:25,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states and 6176 transitions. [2025-03-04 09:25:25,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 09:25:25,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:25,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:25,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:25:25,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:25,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:25,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2042781123, now seen corresponding path program 1 times [2025-03-04 09:25:25,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:25,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691664744] [2025-03-04 09:25:25,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:25,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:25,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:25:25,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:25:25,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:25,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:25,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:25,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691664744] [2025-03-04 09:25:25,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691664744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:25,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:25,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:25:25,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386735541] [2025-03-04 09:25:25,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:25,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:25,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:25,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:25,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:25,263 INFO L87 Difference]: Start difference. First operand 3562 states and 6176 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:25,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:25,900 INFO L93 Difference]: Finished difference Result 6774 states and 11761 transitions. [2025-03-04 09:25:25,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:25:25,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 09:25:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:25,920 INFO L225 Difference]: With dead ends: 6774 [2025-03-04 09:25:25,920 INFO L226 Difference]: Without dead ends: 6774 [2025-03-04 09:25:25,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:25:25,924 INFO L435 NwaCegarLoop]: 3126 mSDtfsCounter, 2100 mSDsluCounter, 5670 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2603 SdHoareTripleChecker+Valid, 8796 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:25,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2603 Valid, 8796 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:25:25,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6774 states. [2025-03-04 09:25:26,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6774 to 3564. [2025-03-04 09:25:26,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 2210 states have (on average 1.8850678733031674) internal successors, (4166), 3555 states have internal predecessors, (4166), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-03-04 09:25:26,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 6178 transitions. [2025-03-04 09:25:26,266 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 6178 transitions. Word has length 10 [2025-03-04 09:25:26,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:26,266 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 6178 transitions. [2025-03-04 09:25:26,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 6178 transitions. [2025-03-04 09:25:26,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 09:25:26,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:26,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:26,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:25:26,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr407REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:26,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:26,268 INFO L85 PathProgramCache]: Analyzing trace with hash -813920145, now seen corresponding path program 1 times [2025-03-04 09:25:26,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:26,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525492726] [2025-03-04 09:25:26,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:26,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:26,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:25:26,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:25:26,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:26,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:26,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:26,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525492726] [2025-03-04 09:25:26,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525492726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:26,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:26,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:26,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865448095] [2025-03-04 09:25:26,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:26,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:26,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:26,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:26,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:26,348 INFO L87 Difference]: Start difference. First operand 3564 states and 6178 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:28,060 INFO L93 Difference]: Finished difference Result 3639 states and 6284 transitions. [2025-03-04 09:25:28,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:25:28,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 09:25:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:28,068 INFO L225 Difference]: With dead ends: 3639 [2025-03-04 09:25:28,068 INFO L226 Difference]: Without dead ends: 3639 [2025-03-04 09:25:28,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:25:28,071 INFO L435 NwaCegarLoop]: 2682 mSDtfsCounter, 2336 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 2413 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2839 SdHoareTripleChecker+Valid, 4246 SdHoareTripleChecker+Invalid, 2441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:28,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2839 Valid, 4246 Invalid, 2441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2413 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 09:25:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2025-03-04 09:25:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 3541. [2025-03-04 09:25:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3541 states, 2210 states have (on average 1.8642533936651584) internal successors, (4120), 3532 states have internal predecessors, (4120), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-03-04 09:25:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 6132 transitions. [2025-03-04 09:25:28,216 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 6132 transitions. Word has length 17 [2025-03-04 09:25:28,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:28,216 INFO L471 AbstractCegarLoop]: Abstraction has 3541 states and 6132 transitions. [2025-03-04 09:25:28,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:28,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 6132 transitions. [2025-03-04 09:25:28,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 09:25:28,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:28,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:28,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:25:28,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr408REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:28,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:28,218 INFO L85 PathProgramCache]: Analyzing trace with hash -813920144, now seen corresponding path program 1 times [2025-03-04 09:25:28,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:28,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746833230] [2025-03-04 09:25:28,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:28,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:28,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:25:28,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:25:28,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:28,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:28,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:28,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746833230] [2025-03-04 09:25:28,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746833230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:28,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:28,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:28,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365388490] [2025-03-04 09:25:28,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:28,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:28,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:28,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:28,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:28,265 INFO L87 Difference]: Start difference. First operand 3541 states and 6132 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:28,338 INFO L93 Difference]: Finished difference Result 3403 states and 5926 transitions. [2025-03-04 09:25:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:28,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 09:25:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:28,346 INFO L225 Difference]: With dead ends: 3403 [2025-03-04 09:25:28,346 INFO L226 Difference]: Without dead ends: 3403 [2025-03-04 09:25:28,346 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-03-04 09:25:28,347 INFO L435 NwaCegarLoop]: 2973 mSDtfsCounter, 60 mSDsluCounter, 2920 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 5893 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:28,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 5893 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:25:28,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2025-03-04 09:25:28,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3403. [2025-03-04 09:25:28,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3403 states, 2084 states have (on average 1.8781190019193859) internal successors, (3914), 3394 states have internal predecessors, (3914), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-03-04 09:25:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 5926 transitions. [2025-03-04 09:25:28,507 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 5926 transitions. Word has length 17 [2025-03-04 09:25:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:28,507 INFO L471 AbstractCegarLoop]: Abstraction has 3403 states and 5926 transitions. [2025-03-04 09:25:28,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 5926 transitions. [2025-03-04 09:25:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:25:28,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:28,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:28,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:25:28,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr384REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:28,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:28,509 INFO L85 PathProgramCache]: Analyzing trace with hash 538158445, now seen corresponding path program 1 times [2025-03-04 09:25:28,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:28,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805028837] [2025-03-04 09:25:28,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:28,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:28,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:25:28,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:25:28,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:28,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:28,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:28,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805028837] [2025-03-04 09:25:28,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805028837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:28,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:28,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:25:28,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670631077] [2025-03-04 09:25:28,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:28,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:28,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:28,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:28,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:28,563 INFO L87 Difference]: Start difference. First operand 3403 states and 5926 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:28,657 INFO L93 Difference]: Finished difference Result 3374 states and 5876 transitions. [2025-03-04 09:25:28,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:25:28,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 09:25:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:28,664 INFO L225 Difference]: With dead ends: 3374 [2025-03-04 09:25:28,664 INFO L226 Difference]: Without dead ends: 3374 [2025-03-04 09:25:28,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:25:28,665 INFO L435 NwaCegarLoop]: 2938 mSDtfsCounter, 41 mSDsluCounter, 5848 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8786 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:28,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8786 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:25:28,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3374 states. [2025-03-04 09:25:28,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3374 to 3368. [2025-03-04 09:25:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 2056 states have (on average 1.8764591439688716) internal successors, (3858), 3359 states have internal predecessors, (3858), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-03-04 09:25:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 5870 transitions. [2025-03-04 09:25:28,815 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 5870 transitions. Word has length 18 [2025-03-04 09:25:28,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:28,816 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 5870 transitions. [2025-03-04 09:25:28,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 5870 transitions. [2025-03-04 09:25:28,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 09:25:28,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:28,817 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] [2025-03-04 09:25:28,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:25:28,817 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:28,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:28,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1584729219, now seen corresponding path program 1 times [2025-03-04 09:25:28,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:28,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982394307] [2025-03-04 09:25:28,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:28,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:28,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 09:25:28,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 09:25:28,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:28,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:28,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:28,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982394307] [2025-03-04 09:25:28,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982394307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:28,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:28,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:28,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484206221] [2025-03-04 09:25:28,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:28,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:28,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:28,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:28,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:28,976 INFO L87 Difference]: Start difference. First operand 3368 states and 5870 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:30,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:30,776 INFO L93 Difference]: Finished difference Result 6060 states and 10819 transitions. [2025-03-04 09:25:30,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:25:30,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2025-03-04 09:25:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:30,790 INFO L225 Difference]: With dead ends: 6060 [2025-03-04 09:25:30,790 INFO L226 Difference]: Without dead ends: 6060 [2025-03-04 09:25:30,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:25:30,791 INFO L435 NwaCegarLoop]: 2775 mSDtfsCounter, 1814 mSDsluCounter, 3517 mSDsCounter, 0 mSdLazyCounter, 2476 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2314 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:30,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2314 Valid, 6292 Invalid, 2479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2476 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 09:25:30,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2025-03-04 09:25:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 3364. [2025-03-04 09:25:31,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3364 states, 2056 states have (on average 1.872568093385214) internal successors, (3850), 3355 states have internal predecessors, (3850), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-03-04 09:25:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 5862 transitions. [2025-03-04 09:25:31,078 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 5862 transitions. Word has length 32 [2025-03-04 09:25:31,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:31,078 INFO L471 AbstractCegarLoop]: Abstraction has 3364 states and 5862 transitions. [2025-03-04 09:25:31,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:31,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 5862 transitions. [2025-03-04 09:25:31,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 09:25:31,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:31,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:31,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:25:31,080 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:31,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:31,080 INFO L85 PathProgramCache]: Analyzing trace with hash 746908311, now seen corresponding path program 1 times [2025-03-04 09:25:31,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:31,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248438429] [2025-03-04 09:25:31,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:31,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:31,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 09:25:31,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 09:25:31,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:31,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:31,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:31,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248438429] [2025-03-04 09:25:31,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248438429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:31,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:31,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:25:31,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132299411] [2025-03-04 09:25:31,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:31,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:31,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:31,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:31,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:31,173 INFO L87 Difference]: Start difference. First operand 3364 states and 5862 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:31,265 INFO L93 Difference]: Finished difference Result 3364 states and 5854 transitions. [2025-03-04 09:25:31,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:25:31,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2025-03-04 09:25:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:31,273 INFO L225 Difference]: With dead ends: 3364 [2025-03-04 09:25:31,273 INFO L226 Difference]: Without dead ends: 3364 [2025-03-04 09:25:31,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:25:31,274 INFO L435 NwaCegarLoop]: 2933 mSDtfsCounter, 21 mSDsluCounter, 5835 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8768 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:31,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8768 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:25:31,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2025-03-04 09:25:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 3364. [2025-03-04 09:25:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3364 states, 2056 states have (on average 1.8686770428015564) internal successors, (3842), 3355 states have internal predecessors, (3842), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-03-04 09:25:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 5854 transitions. [2025-03-04 09:25:31,443 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 5854 transitions. Word has length 66 [2025-03-04 09:25:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:31,444 INFO L471 AbstractCegarLoop]: Abstraction has 3364 states and 5854 transitions. [2025-03-04 09:25:31,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 5854 transitions. [2025-03-04 09:25:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 09:25:31,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:31,446 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] [2025-03-04 09:25:31,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:25:31,446 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:31,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:31,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1524477663, now seen corresponding path program 1 times [2025-03-04 09:25:31,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:31,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303805809] [2025-03-04 09:25:31,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:31,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:31,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 09:25:31,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 09:25:31,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:31,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:31,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:31,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303805809] [2025-03-04 09:25:31,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303805809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:31,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:31,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:31,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773298457] [2025-03-04 09:25:31,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:31,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:31,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:31,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:31,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:31,583 INFO L87 Difference]: Start difference. First operand 3364 states and 5854 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:31,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:31,711 INFO L93 Difference]: Finished difference Result 5868 states and 10570 transitions. [2025-03-04 09:25:31,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:31,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2025-03-04 09:25:31,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:31,725 INFO L225 Difference]: With dead ends: 5868 [2025-03-04 09:25:31,725 INFO L226 Difference]: Without dead ends: 5868 [2025-03-04 09:25:31,725 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-03-04 09:25:31,726 INFO L435 NwaCegarLoop]: 3220 mSDtfsCounter, 1352 mSDsluCounter, 2902 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1852 SdHoareTripleChecker+Valid, 6122 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:31,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1852 Valid, 6122 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:25:31,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5868 states. [2025-03-04 09:25:32,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5868 to 5811. [2025-03-04 09:25:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5811 states, 3503 states have (on average 1.8712532115329716) internal successors, (6555), 5802 states have internal predecessors, (6555), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-03-04 09:25:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5811 states to 5811 states and 10567 transitions. [2025-03-04 09:25:32,151 INFO L78 Accepts]: Start accepts. Automaton has 5811 states and 10567 transitions. Word has length 74 [2025-03-04 09:25:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:32,151 INFO L471 AbstractCegarLoop]: Abstraction has 5811 states and 10567 transitions. [2025-03-04 09:25:32,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 5811 states and 10567 transitions. [2025-03-04 09:25:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 09:25:32,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:32,156 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] [2025-03-04 09:25:32,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:25:32,156 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr326REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:32,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:32,157 INFO L85 PathProgramCache]: Analyzing trace with hash 731447270, now seen corresponding path program 1 times [2025-03-04 09:25:32,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:32,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199906938] [2025-03-04 09:25:32,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:32,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:32,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 09:25:32,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 09:25:32,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:32,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:32,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:32,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199906938] [2025-03-04 09:25:32,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199906938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:32,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:32,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:25:32,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11535568] [2025-03-04 09:25:32,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:32,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:25:32,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:32,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:25:32,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:25:32,507 INFO L87 Difference]: Start difference. First operand 5811 states and 10567 transitions. Second operand has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:34,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:34,724 INFO L93 Difference]: Finished difference Result 5773 states and 10515 transitions. [2025-03-04 09:25:34,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:25:34,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 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 77 [2025-03-04 09:25:34,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:34,736 INFO L225 Difference]: With dead ends: 5773 [2025-03-04 09:25:34,736 INFO L226 Difference]: Without dead ends: 5773 [2025-03-04 09:25:34,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:25:34,736 INFO L435 NwaCegarLoop]: 2455 mSDtfsCounter, 1869 mSDsluCounter, 2842 mSDsCounter, 0 mSdLazyCounter, 4001 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2372 SdHoareTripleChecker+Valid, 5297 SdHoareTripleChecker+Invalid, 4044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:34,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2372 Valid, 5297 Invalid, 4044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4001 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 09:25:34,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5773 states. [2025-03-04 09:25:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5773 to 5695. [2025-03-04 09:25:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5695 states, 3425 states have (on average 1.8531386861313868) internal successors, (6347), 5686 states have internal predecessors, (6347), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-03-04 09:25:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5695 states to 5695 states and 10359 transitions. [2025-03-04 09:25:35,046 INFO L78 Accepts]: Start accepts. Automaton has 5695 states and 10359 transitions. Word has length 77 [2025-03-04 09:25:35,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:35,047 INFO L471 AbstractCegarLoop]: Abstraction has 5695 states and 10359 transitions. [2025-03-04 09:25:35,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 5695 states and 10359 transitions. [2025-03-04 09:25:35,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 09:25:35,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:35,049 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] [2025-03-04 09:25:35,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:25:35,049 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:35,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:35,050 INFO L85 PathProgramCache]: Analyzing trace with hash -615236501, now seen corresponding path program 1 times [2025-03-04 09:25:35,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:35,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223559505] [2025-03-04 09:25:35,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:35,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:35,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 09:25:35,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 09:25:35,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:35,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:35,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:35,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223559505] [2025-03-04 09:25:35,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223559505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:35,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:35,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:25:35,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396717447] [2025-03-04 09:25:35,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:35,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:25:35,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:35,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:25:35,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:25:35,239 INFO L87 Difference]: Start difference. First operand 5695 states and 10359 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:35,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:35,748 INFO L93 Difference]: Finished difference Result 5694 states and 10357 transitions. [2025-03-04 09:25:35,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:25:35,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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 82 [2025-03-04 09:25:35,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:35,761 INFO L225 Difference]: With dead ends: 5694 [2025-03-04 09:25:35,761 INFO L226 Difference]: Without dead ends: 5694 [2025-03-04 09:25:35,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:25:35,762 INFO L435 NwaCegarLoop]: 2905 mSDtfsCounter, 2 mSDsluCounter, 7747 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10652 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:35,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10652 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:25:35,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5694 states. [2025-03-04 09:25:36,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5694 to 5694. [2025-03-04 09:25:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5694 states, 3425 states have (on average 1.8525547445255475) internal successors, (6345), 5685 states have internal predecessors, (6345), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-03-04 09:25:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5694 states to 5694 states and 10357 transitions. [2025-03-04 09:25:36,078 INFO L78 Accepts]: Start accepts. Automaton has 5694 states and 10357 transitions. Word has length 82 [2025-03-04 09:25:36,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:36,078 INFO L471 AbstractCegarLoop]: Abstraction has 5694 states and 10357 transitions. [2025-03-04 09:25:36,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 5694 states and 10357 transitions. [2025-03-04 09:25:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 09:25:36,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:36,079 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] [2025-03-04 09:25:36,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:25:36,079 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr320REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:36,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:36,080 INFO L85 PathProgramCache]: Analyzing trace with hash -615236500, now seen corresponding path program 1 times [2025-03-04 09:25:36,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:36,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956054185] [2025-03-04 09:25:36,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:36,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:36,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 09:25:36,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 09:25:36,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:36,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:36,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:36,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:36,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956054185] [2025-03-04 09:25:36,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956054185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:36,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:36,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:25:36,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700498508] [2025-03-04 09:25:36,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:36,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:25:36,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:36,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:25:36,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:25:36,368 INFO L87 Difference]: Start difference. First operand 5694 states and 10357 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:37,012 INFO L93 Difference]: Finished difference Result 5693 states and 10355 transitions. [2025-03-04 09:25:37,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:25:37,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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 82 [2025-03-04 09:25:37,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:37,023 INFO L225 Difference]: With dead ends: 5693 [2025-03-04 09:25:37,024 INFO L226 Difference]: Without dead ends: 5693 [2025-03-04 09:25:37,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:25:37,024 INFO L435 NwaCegarLoop]: 2905 mSDtfsCounter, 1 mSDsluCounter, 7731 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10636 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:37,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10636 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:25:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5693 states. [2025-03-04 09:25:37,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5693 to 5693. [2025-03-04 09:25:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5693 states, 3423 states have (on average 1.8530528775927548) internal successors, (6343), 5684 states have internal predecessors, (6343), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-03-04 09:25:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5693 states to 5693 states and 10355 transitions. [2025-03-04 09:25:37,432 INFO L78 Accepts]: Start accepts. Automaton has 5693 states and 10355 transitions. Word has length 82 [2025-03-04 09:25:37,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:37,432 INFO L471 AbstractCegarLoop]: Abstraction has 5693 states and 10355 transitions. [2025-03-04 09:25:37,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 5693 states and 10355 transitions. [2025-03-04 09:25:37,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 09:25:37,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:37,433 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] [2025-03-04 09:25:37,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:25:37,433 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:37,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:37,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1546058712, now seen corresponding path program 1 times [2025-03-04 09:25:37,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:37,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485277363] [2025-03-04 09:25:37,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:37,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:37,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 09:25:37,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 09:25:37,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:37,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:37,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:37,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485277363] [2025-03-04 09:25:37,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485277363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:37,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:37,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:25:37,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730731086] [2025-03-04 09:25:37,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:37,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:25:37,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:37,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:25:37,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:25:37,612 INFO L87 Difference]: Start difference. First operand 5693 states and 10355 transitions. Second operand has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:40,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:40,368 INFO L93 Difference]: Finished difference Result 5711 states and 10381 transitions. [2025-03-04 09:25:40,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:25:40,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2025-03-04 09:25:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:40,385 INFO L225 Difference]: With dead ends: 5711 [2025-03-04 09:25:40,385 INFO L226 Difference]: Without dead ends: 5711 [2025-03-04 09:25:40,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:25:40,389 INFO L435 NwaCegarLoop]: 2890 mSDtfsCounter, 13 mSDsluCounter, 9770 mSDsCounter, 0 mSdLazyCounter, 4464 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12660 SdHoareTripleChecker+Invalid, 4969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 4464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:40,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12660 Invalid, 4969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 4464 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-04 09:25:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5711 states. [2025-03-04 09:25:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5711 to 5702. [2025-03-04 09:25:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5702 states, 3431 states have (on average 1.8519382104342756) internal successors, (6354), 5691 states have internal predecessors, (6354), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 3 states have return successors, (2010), 11 states have call predecessors, (2010), 2005 states have call successors, (2010) [2025-03-04 09:25:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5702 states to 5702 states and 10371 transitions. [2025-03-04 09:25:40,701 INFO L78 Accepts]: Start accepts. Automaton has 5702 states and 10371 transitions. Word has length 90 [2025-03-04 09:25:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:40,701 INFO L471 AbstractCegarLoop]: Abstraction has 5702 states and 10371 transitions. [2025-03-04 09:25:40,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 5702 states and 10371 transitions. [2025-03-04 09:25:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 09:25:40,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:40,702 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] [2025-03-04 09:25:40,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:25:40,703 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:40,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:40,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1546058711, now seen corresponding path program 1 times [2025-03-04 09:25:40,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:40,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915399048] [2025-03-04 09:25:40,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:40,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:40,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 09:25:40,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 09:25:40,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:40,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:41,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:41,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915399048] [2025-03-04 09:25:41,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915399048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:41,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:41,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:25:41,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532817457] [2025-03-04 09:25:41,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:41,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:25:41,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:41,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:25:41,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:25:41,105 INFO L87 Difference]: Start difference. First operand 5702 states and 10371 transitions. Second operand has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:43,554 INFO L93 Difference]: Finished difference Result 5702 states and 10369 transitions. [2025-03-04 09:25:43,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:25:43,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2025-03-04 09:25:43,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:43,569 INFO L225 Difference]: With dead ends: 5702 [2025-03-04 09:25:43,569 INFO L226 Difference]: Without dead ends: 5702 [2025-03-04 09:25:43,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:25:43,569 INFO L435 NwaCegarLoop]: 2894 mSDtfsCounter, 8 mSDsluCounter, 7987 mSDsCounter, 0 mSdLazyCounter, 3300 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 10881 SdHoareTripleChecker+Invalid, 3803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 3300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:43,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 10881 Invalid, 3803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 3300 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-04 09:25:43,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2025-03-04 09:25:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 5702. [2025-03-04 09:25:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5702 states, 3431 states have (on average 1.8513552900029147) internal successors, (6352), 5691 states have internal predecessors, (6352), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 3 states have return successors, (2010), 11 states have call predecessors, (2010), 2005 states have call successors, (2010) [2025-03-04 09:25:43,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5702 states to 5702 states and 10369 transitions. [2025-03-04 09:25:43,909 INFO L78 Accepts]: Start accepts. Automaton has 5702 states and 10369 transitions. Word has length 90 [2025-03-04 09:25:43,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:43,909 INFO L471 AbstractCegarLoop]: Abstraction has 5702 states and 10369 transitions. [2025-03-04 09:25:43,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:43,909 INFO L276 IsEmpty]: Start isEmpty. Operand 5702 states and 10369 transitions. [2025-03-04 09:25:43,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 09:25:43,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:43,910 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-03-04 09:25:43,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:25:43,910 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:43,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:43,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2056226301, now seen corresponding path program 1 times [2025-03-04 09:25:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:43,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543989237] [2025-03-04 09:25:43,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:43,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:43,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:25:43,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:25:43,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:43,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:44,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543989237] [2025-03-04 09:25:44,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543989237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275672830] [2025-03-04 09:25:44,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:44,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:44,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:44,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:25:44,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:25:44,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:25:44,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:25:44,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:44,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:44,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 09:25:44,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:25:44,514 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:25:44,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:25:44,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:25:44,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:25:44,772 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:44,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:25:44,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:25:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:44,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:25:44,857 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_639 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_639) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-04 09:25:44,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275672830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:44,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:25:44,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2025-03-04 09:25:44,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339577707] [2025-03-04 09:25:44,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:25:44,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 09:25:44,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:44,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 09:25:44,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-03-04 09:25:44,861 INFO L87 Difference]: Start difference. First operand 5702 states and 10369 transitions. Second operand has 19 states, 16 states have (on average 7.25) internal successors, (116), 18 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:25:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:51,025 INFO L93 Difference]: Finished difference Result 5709 states and 10375 transitions. [2025-03-04 09:25:51,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:25:51,025 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.25) internal successors, (116), 18 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2025-03-04 09:25:51,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:51,035 INFO L225 Difference]: With dead ends: 5709 [2025-03-04 09:25:51,035 INFO L226 Difference]: Without dead ends: 5709 [2025-03-04 09:25:51,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2025-03-04 09:25:51,036 INFO L435 NwaCegarLoop]: 2579 mSDtfsCounter, 1895 mSDsluCounter, 17646 mSDsCounter, 0 mSdLazyCounter, 12043 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2399 SdHoareTripleChecker+Valid, 20225 SdHoareTripleChecker+Invalid, 12561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 12043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:51,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 20225 Invalid, 12561 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [518 Valid, 12043 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-03-04 09:25:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5709 states. [2025-03-04 09:25:51,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5709 to 5706. [2025-03-04 09:25:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5706 states, 3435 states have (on average 1.8500727802037846) internal successors, (6355), 5694 states have internal predecessors, (6355), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2025-03-04 09:25:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5706 states to 5706 states and 10369 transitions. [2025-03-04 09:25:51,370 INFO L78 Accepts]: Start accepts. Automaton has 5706 states and 10369 transitions. Word has length 91 [2025-03-04 09:25:51,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:51,370 INFO L471 AbstractCegarLoop]: Abstraction has 5706 states and 10369 transitions. [2025-03-04 09:25:51,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.25) internal successors, (116), 18 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:25:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 5706 states and 10369 transitions. [2025-03-04 09:25:51,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 09:25:51,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:51,371 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-03-04 09:25:51,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 09:25:51,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 09:25:51,575 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:25:51,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:51,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2056226302, now seen corresponding path program 1 times [2025-03-04 09:25:51,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:51,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063114110] [2025-03-04 09:25:51,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:51,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:51,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:25:51,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:25:51,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:51,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:52,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:52,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063114110] [2025-03-04 09:25:52,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063114110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:52,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140124961] [2025-03-04 09:25:52,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:52,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:52,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:52,138 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:25:52,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:25:52,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:25:52,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:25:52,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:52,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:52,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 09:25:52,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:25:52,414 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:25:52,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:25:52,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 09:25:52,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:25:52,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 09:25:52,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:25:52,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:25:52,623 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:52,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:25:52,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:25:52,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:25:52,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:25:52,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:52,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:25:52,737 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_781 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_781 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-04 09:25:52,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140124961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:52,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:25:52,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2025-03-04 09:25:52,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124037051] [2025-03-04 09:25:52,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:25:52,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:25:52,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:52,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:25:52,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-03-04 09:25:52,741 INFO L87 Difference]: Start difference. First operand 5706 states and 10369 transitions. Second operand has 15 states, 12 states have (on average 9.166666666666666) internal successors, (110), 15 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:26:00,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:00,782 INFO L93 Difference]: Finished difference Result 5708 states and 10373 transitions. [2025-03-04 09:26:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:26:00,782 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.166666666666666) internal successors, (110), 15 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2025-03-04 09:26:00,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:00,792 INFO L225 Difference]: With dead ends: 5708 [2025-03-04 09:26:00,792 INFO L226 Difference]: Without dead ends: 5708 [2025-03-04 09:26:00,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-03-04 09:26:00,793 INFO L435 NwaCegarLoop]: 2582 mSDtfsCounter, 1880 mSDsluCounter, 16175 mSDsCounter, 0 mSdLazyCounter, 10605 mSolverCounterSat, 1021 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 18757 SdHoareTripleChecker+Invalid, 11626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1021 IncrementalHoareTripleChecker+Valid, 10605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:00,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 18757 Invalid, 11626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1021 Valid, 10605 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2025-03-04 09:26:00,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5708 states. [2025-03-04 09:26:01,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5708 to 5696. [2025-03-04 09:26:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5696 states, 3427 states have (on average 1.8511817916545084) internal successors, (6344), 5686 states have internal predecessors, (6344), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-03-04 09:26:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5696 states to 5696 states and 10356 transitions. [2025-03-04 09:26:01,149 INFO L78 Accepts]: Start accepts. Automaton has 5696 states and 10356 transitions. Word has length 91 [2025-03-04 09:26:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:01,149 INFO L471 AbstractCegarLoop]: Abstraction has 5696 states and 10356 transitions. [2025-03-04 09:26:01,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.166666666666666) internal successors, (110), 15 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:26:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 5696 states and 10356 transitions. [2025-03-04 09:26:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 09:26:01,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:01,150 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-03-04 09:26:01,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 09:26:01,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 09:26:01,351 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:26:01,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:01,352 INFO L85 PathProgramCache]: Analyzing trace with hash 598039895, now seen corresponding path program 1 times [2025-03-04 09:26:01,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:01,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628965569] [2025-03-04 09:26:01,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:01,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:01,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 09:26:01,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 09:26:01,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:01,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:26:01,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:01,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628965569] [2025-03-04 09:26:01,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628965569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:26:01,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:26:01,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 09:26:01,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833930514] [2025-03-04 09:26:01,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:26:01,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:26:01,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:01,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:26:01,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:26:01,701 INFO L87 Difference]: Start difference. First operand 5696 states and 10356 transitions. Second operand has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:26:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:06,517 INFO L93 Difference]: Finished difference Result 5715 states and 10381 transitions. [2025-03-04 09:26:06,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:26:06,517 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-03-04 09:26:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:06,526 INFO L225 Difference]: With dead ends: 5715 [2025-03-04 09:26:06,526 INFO L226 Difference]: Without dead ends: 5715 [2025-03-04 09:26:06,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-03-04 09:26:06,526 INFO L435 NwaCegarLoop]: 2579 mSDtfsCounter, 1880 mSDsluCounter, 16084 mSDsCounter, 0 mSdLazyCounter, 11200 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 18663 SdHoareTripleChecker+Invalid, 11713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 11200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:06,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 18663 Invalid, 11713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 11200 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-04 09:26:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5715 states. [2025-03-04 09:26:06,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5715 to 5711. [2025-03-04 09:26:06,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5711 states, 3441 states have (on average 1.848590526009881) internal successors, (6361), 5699 states have internal predecessors, (6361), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2025-03-04 09:26:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5711 states to 5711 states and 10375 transitions. [2025-03-04 09:26:06,853 INFO L78 Accepts]: Start accepts. Automaton has 5711 states and 10375 transitions. Word has length 93 [2025-03-04 09:26:06,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:06,853 INFO L471 AbstractCegarLoop]: Abstraction has 5711 states and 10375 transitions. [2025-03-04 09:26:06,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:26:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 5711 states and 10375 transitions. [2025-03-04 09:26:06,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 09:26:06,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:06,854 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-03-04 09:26:06,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:26:06,854 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:26:06,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash 598039896, now seen corresponding path program 1 times [2025-03-04 09:26:06,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:06,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116454043] [2025-03-04 09:26:06,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:06,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:06,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 09:26:06,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 09:26:06,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:06,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:26:07,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:07,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116454043] [2025-03-04 09:26:07,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116454043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:26:07,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:26:07,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 09:26:07,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542111944] [2025-03-04 09:26:07,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:26:07,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:26:07,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:07,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:26:07,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:26:07,441 INFO L87 Difference]: Start difference. First operand 5711 states and 10375 transitions. Second operand has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:26:12,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:12,050 INFO L93 Difference]: Finished difference Result 5714 states and 10379 transitions. [2025-03-04 09:26:12,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:26:12,050 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-03-04 09:26:12,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:12,060 INFO L225 Difference]: With dead ends: 5714 [2025-03-04 09:26:12,060 INFO L226 Difference]: Without dead ends: 5714 [2025-03-04 09:26:12,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:26:12,061 INFO L435 NwaCegarLoop]: 2583 mSDtfsCounter, 1895 mSDsluCounter, 13309 mSDsCounter, 0 mSdLazyCounter, 7599 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2399 SdHoareTripleChecker+Valid, 15892 SdHoareTripleChecker+Invalid, 8111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 7599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:12,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 15892 Invalid, 8111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 7599 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-04 09:26:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5714 states. [2025-03-04 09:26:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5714 to 5711. [2025-03-04 09:26:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5711 states, 3441 states have (on average 1.8480092996222028) internal successors, (6359), 5699 states have internal predecessors, (6359), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2025-03-04 09:26:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5711 states to 5711 states and 10373 transitions. [2025-03-04 09:26:12,386 INFO L78 Accepts]: Start accepts. Automaton has 5711 states and 10373 transitions. Word has length 93 [2025-03-04 09:26:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:12,386 INFO L471 AbstractCegarLoop]: Abstraction has 5711 states and 10373 transitions. [2025-03-04 09:26:12,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:26:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 5711 states and 10373 transitions. [2025-03-04 09:26:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 09:26:12,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:12,387 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, 1] [2025-03-04 09:26:12,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 09:26:12,387 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:26:12,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2076962974, now seen corresponding path program 1 times [2025-03-04 09:26:12,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:12,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097850622] [2025-03-04 09:26:12,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:12,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:12,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:26:12,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:26:12,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:12,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:26:12,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:12,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097850622] [2025-03-04 09:26:12,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097850622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:12,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114599422] [2025-03-04 09:26:12,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:12,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:26:12,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:26:12,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:26:12,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:26:12,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:26:12,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:26:12,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:12,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:12,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 09:26:12,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:26:12,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 09:26:13,016 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:26:13,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:26:13,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:26:13,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:26:13,196 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:13,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:26:13,264 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:13,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:26:13,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:26:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:26:13,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:26:13,304 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1063 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1063) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-04 09:26:13,308 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1063 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1063) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-04 09:26:13,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114599422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:13,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:26:13,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-03-04 09:26:13,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610831358] [2025-03-04 09:26:13,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:26:13,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 09:26:13,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:13,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 09:26:13,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=420, Unknown=17, NotChecked=86, Total=600 [2025-03-04 09:26:13,358 INFO L87 Difference]: Start difference. First operand 5711 states and 10373 transitions. Second operand has 22 states, 19 states have (on average 7.842105263157895) internal successors, (149), 21 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:26:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:19,294 INFO L93 Difference]: Finished difference Result 5713 states and 10377 transitions. [2025-03-04 09:26:19,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:26:19,294 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.842105263157895) internal successors, (149), 21 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2025-03-04 09:26:19,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:19,304 INFO L225 Difference]: With dead ends: 5713 [2025-03-04 09:26:19,304 INFO L226 Difference]: Without dead ends: 5713 [2025-03-04 09:26:19,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=541, Unknown=19, NotChecked=98, Total=756 [2025-03-04 09:26:19,305 INFO L435 NwaCegarLoop]: 2578 mSDtfsCounter, 1862 mSDsluCounter, 15589 mSDsCounter, 0 mSdLazyCounter, 11691 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2366 SdHoareTripleChecker+Valid, 18167 SdHoareTripleChecker+Invalid, 12206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 11691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:19,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2366 Valid, 18167 Invalid, 12206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 11691 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-03-04 09:26:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5713 states. [2025-03-04 09:26:19,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5713 to 5710. [2025-03-04 09:26:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5710 states, 3441 states have (on average 1.8474280732345247) internal successors, (6357), 5698 states have internal predecessors, (6357), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2025-03-04 09:26:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5710 states to 5710 states and 10371 transitions. [2025-03-04 09:26:19,634 INFO L78 Accepts]: Start accepts. Automaton has 5710 states and 10371 transitions. Word has length 94 [2025-03-04 09:26:19,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:19,634 INFO L471 AbstractCegarLoop]: Abstraction has 5710 states and 10371 transitions. [2025-03-04 09:26:19,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.842105263157895) internal successors, (149), 21 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:26:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 5710 states and 10371 transitions. [2025-03-04 09:26:19,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 09:26:19,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:19,635 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, 1] [2025-03-04 09:26:19,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 09:26:19,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:26:19,836 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:26:19,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:19,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2076962973, now seen corresponding path program 1 times [2025-03-04 09:26:19,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:19,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410700402] [2025-03-04 09:26:19,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:19,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:19,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:26:19,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:26:19,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:19,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:26:20,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:20,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410700402] [2025-03-04 09:26:20,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410700402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:20,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691863563] [2025-03-04 09:26:20,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:20,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:26:20,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:26:20,343 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:26:20,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:26:20,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:26:20,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:26:20,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:20,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:20,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 09:26:20,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:26:20,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 09:26:20,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 09:26:20,624 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:26:20,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:26:20,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:26:20,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 09:26:20,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:26:20,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:26:20,804 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:20,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:26:20,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:26:20,863 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:20,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:26:20,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:26:20,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:26:20,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:26:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:26:20,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:26:20,939 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1217 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-04 09:26:20,947 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1217 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-04 09:26:20,985 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1224))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1223) .cse0 v_ArrVal_1217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1223) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1224) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2025-03-04 09:26:20,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691863563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:20,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:26:20,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-03-04 09:26:20,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234909191] [2025-03-04 09:26:20,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:26:20,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 09:26:20,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:20,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 09:26:20,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=398, Unknown=3, NotChecked=126, Total=600 [2025-03-04 09:26:20,988 INFO L87 Difference]: Start difference. First operand 5710 states and 10371 transitions. Second operand has 20 states, 17 states have (on average 8.764705882352942) internal successors, (149), 20 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:26:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:28,521 INFO L93 Difference]: Finished difference Result 5712 states and 10375 transitions. [2025-03-04 09:26:28,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:26:28,521 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.764705882352942) internal successors, (149), 20 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2025-03-04 09:26:28,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:28,530 INFO L225 Difference]: With dead ends: 5712 [2025-03-04 09:26:28,530 INFO L226 Difference]: Without dead ends: 5712 [2025-03-04 09:26:28,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=595, Unknown=3, NotChecked=156, Total=870 [2025-03-04 09:26:28,532 INFO L435 NwaCegarLoop]: 2581 mSDtfsCounter, 1869 mSDsluCounter, 19798 mSDsCounter, 0 mSdLazyCounter, 12325 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2373 SdHoareTripleChecker+Valid, 22379 SdHoareTripleChecker+Invalid, 12842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 12325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:28,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2373 Valid, 22379 Invalid, 12842 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [517 Valid, 12325 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-03-04 09:26:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5712 states. [2025-03-04 09:26:28,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5712 to 5694. [2025-03-04 09:26:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5694 states, 3427 states have (on average 1.8500145900204261) internal successors, (6340), 5684 states have internal predecessors, (6340), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-03-04 09:26:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5694 states to 5694 states and 10352 transitions. [2025-03-04 09:26:28,877 INFO L78 Accepts]: Start accepts. Automaton has 5694 states and 10352 transitions. Word has length 94 [2025-03-04 09:26:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:28,877 INFO L471 AbstractCegarLoop]: Abstraction has 5694 states and 10352 transitions. [2025-03-04 09:26:28,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.764705882352942) internal successors, (149), 20 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:26:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 5694 states and 10352 transitions. [2025-03-04 09:26:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 09:26:28,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:28,877 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, 1, 1, 1] [2025-03-04 09:26:28,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 09:26:29,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:26:29,078 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:26:29,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:29,079 INFO L85 PathProgramCache]: Analyzing trace with hash 686007969, now seen corresponding path program 1 times [2025-03-04 09:26:29,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:29,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404032418] [2025-03-04 09:26:29,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:29,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:29,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 09:26:29,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 09:26:29,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:29,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:26:29,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:29,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404032418] [2025-03-04 09:26:29,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404032418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:26:29,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:26:29,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 09:26:29,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696078539] [2025-03-04 09:26:29,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:26:29,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 09:26:29,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:29,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 09:26:29,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:26:29,371 INFO L87 Difference]: Start difference. First operand 5694 states and 10352 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:26:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:33,384 INFO L93 Difference]: Finished difference Result 5719 states and 10383 transitions. [2025-03-04 09:26:33,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:26:33,385 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2025-03-04 09:26:33,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:33,394 INFO L225 Difference]: With dead ends: 5719 [2025-03-04 09:26:33,394 INFO L226 Difference]: Without dead ends: 5719 [2025-03-04 09:26:33,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-04 09:26:33,395 INFO L435 NwaCegarLoop]: 2581 mSDtfsCounter, 1899 mSDsluCounter, 12980 mSDsCounter, 0 mSdLazyCounter, 7933 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2403 SdHoareTripleChecker+Valid, 15561 SdHoareTripleChecker+Invalid, 8445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 7933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:33,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2403 Valid, 15561 Invalid, 8445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 7933 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-04 09:26:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5719 states. [2025-03-04 09:26:33,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5719 to 5715. [2025-03-04 09:26:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5715 states, 3447 states have (on average 1.845953002610966) internal successors, (6363), 5703 states have internal predecessors, (6363), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2025-03-04 09:26:33,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5715 states to 5715 states and 10377 transitions. [2025-03-04 09:26:33,738 INFO L78 Accepts]: Start accepts. Automaton has 5715 states and 10377 transitions. Word has length 96 [2025-03-04 09:26:33,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:33,739 INFO L471 AbstractCegarLoop]: Abstraction has 5715 states and 10377 transitions. [2025-03-04 09:26:33,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:26:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 5715 states and 10377 transitions. [2025-03-04 09:26:33,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 09:26:33,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:33,739 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, 1, 1, 1] [2025-03-04 09:26:33,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 09:26:33,739 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-03-04 09:26:33,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:33,741 INFO L85 PathProgramCache]: Analyzing trace with hash 686007970, now seen corresponding path program 1 times [2025-03-04 09:26:33,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:33,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373809248] [2025-03-04 09:26:33,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:33,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:33,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 09:26:33,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 09:26:33,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:33,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat