./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b06fba6fbf61d996c1af57497d908c6dba492febf0212a36ee7b28f5806d365e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:16:34,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:16:34,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:16:34,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:16:34,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:16:34,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:16:34,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:16:34,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:16:34,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:16:34,313 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:16:34,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:16:34,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:16:34,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:16:34,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:16:34,314 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:16:34,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:16:34,314 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:16:34,314 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:16:34,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:16:34,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:16:34,314 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:16:34,315 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:16:34,315 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:16:34,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:16:34,315 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:16:34,315 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:16:34,315 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:16:34,315 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:16:34,315 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:16:34,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:16:34,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:16:34,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:16:34,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:16:34,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:16:34,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:16:34,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:16:34,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:16:34,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:16:34,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:16:34,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:16:34,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:16:34,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:16:34,317 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b06fba6fbf61d996c1af57497d908c6dba492febf0212a36ee7b28f5806d365e [2025-02-06 12:16:34,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:16:34,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:16:34,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:16:34,568 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:16:34,570 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:16:34,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i [2025-02-06 12:16:35,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/624a31318/97b34a6aebfe4549a49c9c20415cf069/FLAG58336ce11 [2025-02-06 12:16:36,276 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:16:36,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i [2025-02-06 12:16:36,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/624a31318/97b34a6aebfe4549a49c9c20415cf069/FLAG58336ce11 [2025-02-06 12:16:36,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/624a31318/97b34a6aebfe4549a49c9c20415cf069 [2025-02-06 12:16:36,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:16:36,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:16:36,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:16:36,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:16:36,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:16:36,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:16:36" (1/1) ... [2025-02-06 12:16:36,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b421a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:36, skipping insertion in model container [2025-02-06 12:16:36,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:16:36" (1/1) ... [2025-02-06 12:16:36,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:16:36,667 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,699 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,702 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,705 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,710 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,744 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,745 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,747 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,754 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,790 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,790 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,796 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,797 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,818 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,818 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,820 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,820 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,845 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,845 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,847 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,847 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,865 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,865 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,867 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,867 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:16:36,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:16:36,895 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:16:37,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:16:37,058 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:16:37,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:37 WrapperNode [2025-02-06 12:16:37,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:16:37,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:16:37,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:16:37,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:16:37,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:37" (1/1) ... [2025-02-06 12:16:37,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:37" (1/1) ... [2025-02-06 12:16:37,196 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3338 [2025-02-06 12:16:37,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:16:37,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:16:37,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:16:37,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:16:37,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:37" (1/1) ... [2025-02-06 12:16:37,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:37" (1/1) ... [2025-02-06 12:16:37,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:37" (1/1) ... [2025-02-06 12:16:37,405 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 106, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 4, 82]. [2025-02-06 12:16:37,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:37" (1/1) ... [2025-02-06 12:16:37,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:37" (1/1) ... [2025-02-06 12:16:37,488 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:37" (1/1) ... [2025-02-06 12:16:37,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:37" (1/1) ... [2025-02-06 12:16:37,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:37" (1/1) ... [2025-02-06 12:16:37,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:37" (1/1) ... [2025-02-06 12:16:37,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:16:37,552 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:16:37,553 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:16:37,553 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:16:37,554 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:37" (1/1) ... [2025-02-06 12:16:37,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:16:37,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:16:37,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:16:37,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:16:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-02-06 12:16:37,620 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-02-06 12:16:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:16:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:16:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:16:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 12:16:37,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 12:16:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:16:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:16:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:16:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 12:16:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 12:16:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 12:16:37,620 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 12:16:37,620 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 12:16:37,620 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 12:16:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:16:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:16:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:16:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:16:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:16:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:16:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:16:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:16:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:16:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:16:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:16:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:16:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:16:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:16:37,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:16:37,916 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:16:37,918 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:16:41,689 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: 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-02-06 12:16:41,982 INFO L? ?]: Removed 2487 outVars from TransFormulas that were not future-live. [2025-02-06 12:16:41,983 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:16:42,117 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:16:42,118 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 12:16:42,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:16:42 BoogieIcfgContainer [2025-02-06 12:16:42,121 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:16:42,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:16:42,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:16:42,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:16:42,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:16:36" (1/3) ... [2025-02-06 12:16:42,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fcea2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:16:42, skipping insertion in model container [2025-02-06 12:16:42,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:37" (2/3) ... [2025-02-06 12:16:42,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fcea2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:16:42, skipping insertion in model container [2025-02-06 12:16:42,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:16:42" (3/3) ... [2025-02-06 12:16:42,130 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test10-1.i [2025-02-06 12:16:42,144 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:16:42,146 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test10-1.i that has 6 procedures, 2681 locations, 1 initial locations, 84 loop locations, and 986 error locations. [2025-02-06 12:16:42,263 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:16:42,274 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;@17cc9d07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:16:42,276 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2025-02-06 12:16:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand has 2671 states, 1673 states have (on average 1.9581589958158996) internal successors, (3276), 2657 states have internal predecessors, (3276), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 12:16:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:16:42,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:42,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:16:42,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr983REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:16:42,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:42,295 INFO L85 PathProgramCache]: Analyzing trace with hash 3428796, now seen corresponding path program 1 times [2025-02-06 12:16:42,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:42,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125382693] [2025-02-06 12:16:42,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:42,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:42,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:16:42,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:16:42,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:42,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:16:42,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:42,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125382693] [2025-02-06 12:16:42,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125382693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:42,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:42,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:16:42,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278120593] [2025-02-06 12:16:42,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:42,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:16:42,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:42,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:16:42,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:16:42,522 INFO L87 Difference]: Start difference. First operand has 2671 states, 1673 states have (on average 1.9581589958158996) internal successors, (3276), 2657 states have internal predecessors, (3276), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) 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-02-06 12:16:44,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:44,225 INFO L93 Difference]: Finished difference Result 3261 states and 3832 transitions. [2025-02-06 12:16:44,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:16:44,227 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-02-06 12:16:44,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:44,254 INFO L225 Difference]: With dead ends: 3261 [2025-02-06 12:16:44,254 INFO L226 Difference]: Without dead ends: 3259 [2025-02-06 12:16:44,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:16:44,260 INFO L435 NwaCegarLoop]: 2098 mSDtfsCounter, 2890 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2900 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:44,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2900 Valid, 2617 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 12:16:44,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2025-02-06 12:16:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 2911. [2025-02-06 12:16:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2911 states, 1941 states have (on average 1.8562596599690881) internal successors, (3603), 2895 states have internal predecessors, (3603), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 12:16:44,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 3635 transitions. [2025-02-06 12:16:44,433 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 3635 transitions. Word has length 3 [2025-02-06 12:16:44,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:44,434 INFO L471 AbstractCegarLoop]: Abstraction has 2911 states and 3635 transitions. [2025-02-06 12:16:44,434 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-02-06 12:16:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 3635 transitions. [2025-02-06 12:16:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:16:44,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:44,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:16:44,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:16:44,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr984REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:16:44,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:44,435 INFO L85 PathProgramCache]: Analyzing trace with hash 3428797, now seen corresponding path program 1 times [2025-02-06 12:16:44,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:44,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492414171] [2025-02-06 12:16:44,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:44,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:16:44,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:16:44,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:44,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:16:44,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:44,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492414171] [2025-02-06 12:16:44,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492414171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:44,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:44,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:16:44,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870814504] [2025-02-06 12:16:44,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:44,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:16:44,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:44,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:16:44,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:16:44,547 INFO L87 Difference]: Start difference. First operand 2911 states and 3635 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-02-06 12:16:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:46,386 INFO L93 Difference]: Finished difference Result 4097 states and 5125 transitions. [2025-02-06 12:16:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:16:46,387 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-02-06 12:16:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:46,404 INFO L225 Difference]: With dead ends: 4097 [2025-02-06 12:16:46,405 INFO L226 Difference]: Without dead ends: 4097 [2025-02-06 12:16:46,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:16:46,406 INFO L435 NwaCegarLoop]: 2648 mSDtfsCounter, 1484 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 4661 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:46,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 4661 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 12:16:46,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2025-02-06 12:16:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 3769. [2025-02-06 12:16:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3769 states, 2797 states have (on average 1.8187343582409725) internal successors, (5087), 3750 states have internal predecessors, (5087), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 12:16:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3769 states and 5125 transitions. [2025-02-06 12:16:46,494 INFO L78 Accepts]: Start accepts. Automaton has 3769 states and 5125 transitions. Word has length 3 [2025-02-06 12:16:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:46,495 INFO L471 AbstractCegarLoop]: Abstraction has 3769 states and 5125 transitions. [2025-02-06 12:16:46,495 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-02-06 12:16:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3769 states and 5125 transitions. [2025-02-06 12:16:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 12:16:46,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:46,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:16:46,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:16:46,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr980REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:16:46,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:46,496 INFO L85 PathProgramCache]: Analyzing trace with hash 978052379, now seen corresponding path program 1 times [2025-02-06 12:16:46,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:46,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200613016] [2025-02-06 12:16:46,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:46,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:46,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:16:46,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:16:46,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:46,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:16:46,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200613016] [2025-02-06 12:16:46,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200613016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:46,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:46,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:16:46,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570162560] [2025-02-06 12:16:46,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:46,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:16:46,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:46,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:16:46,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:16:46,739 INFO L87 Difference]: Start difference. First operand 3769 states and 5125 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-02-06 12:16:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:51,521 INFO L93 Difference]: Finished difference Result 7053 states and 8633 transitions. [2025-02-06 12:16:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:16:51,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-02-06 12:16:51,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:51,546 INFO L225 Difference]: With dead ends: 7053 [2025-02-06 12:16:51,547 INFO L226 Difference]: Without dead ends: 7053 [2025-02-06 12:16:51,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:16:51,548 INFO L435 NwaCegarLoop]: 2479 mSDtfsCounter, 6213 mSDsluCounter, 5275 mSDsCounter, 0 mSdLazyCounter, 6213 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6216 SdHoareTripleChecker+Valid, 7754 SdHoareTripleChecker+Invalid, 6260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 6213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:51,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6216 Valid, 7754 Invalid, 6260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 6213 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-02-06 12:16:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7053 states. [2025-02-06 12:16:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7053 to 4795. [2025-02-06 12:16:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4795 states, 3823 states have (on average 1.851164007324091) internal successors, (7077), 4770 states have internal predecessors, (7077), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:16:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4795 states to 4795 states and 7127 transitions. [2025-02-06 12:16:51,656 INFO L78 Accepts]: Start accepts. Automaton has 4795 states and 7127 transitions. Word has length 8 [2025-02-06 12:16:51,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:51,657 INFO L471 AbstractCegarLoop]: Abstraction has 4795 states and 7127 transitions. [2025-02-06 12:16:51,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-02-06 12:16:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4795 states and 7127 transitions. [2025-02-06 12:16:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:16:51,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:51,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:16:51,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:16:51,658 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr977REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:16:51,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:51,659 INFO L85 PathProgramCache]: Analyzing trace with hash 254856018, now seen corresponding path program 1 times [2025-02-06 12:16:51,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:51,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885080576] [2025-02-06 12:16:51,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:51,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:51,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:16:51,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:16:51,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:51,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:16:51,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:51,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885080576] [2025-02-06 12:16:51,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885080576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:51,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:51,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:16:51,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843197840] [2025-02-06 12:16:51,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:51,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:16:51,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:51,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:16:51,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:16:51,744 INFO L87 Difference]: Start difference. First operand 4795 states and 7127 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:53,009 INFO L93 Difference]: Finished difference Result 5892 states and 8406 transitions. [2025-02-06 12:16:53,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:16:53,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-02-06 12:16:53,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:53,026 INFO L225 Difference]: With dead ends: 5892 [2025-02-06 12:16:53,026 INFO L226 Difference]: Without dead ends: 5892 [2025-02-06 12:16:53,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:16:53,028 INFO L435 NwaCegarLoop]: 3366 mSDtfsCounter, 2861 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2871 SdHoareTripleChecker+Valid, 4472 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:53,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2871 Valid, 4472 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 12:16:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2025-02-06 12:16:53,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 4703. [2025-02-06 12:16:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4703 states, 3823 states have (on average 1.7949254512163222) internal successors, (6862), 4678 states have internal predecessors, (6862), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:16:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4703 states to 4703 states and 6912 transitions. [2025-02-06 12:16:53,116 INFO L78 Accepts]: Start accepts. Automaton has 4703 states and 6912 transitions. Word has length 9 [2025-02-06 12:16:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:53,116 INFO L471 AbstractCegarLoop]: Abstraction has 4703 states and 6912 transitions. [2025-02-06 12:16:53,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 4703 states and 6912 transitions. [2025-02-06 12:16:53,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:16:53,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:53,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:16:53,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:16:53,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr978REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:16:53,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:53,118 INFO L85 PathProgramCache]: Analyzing trace with hash 254856019, now seen corresponding path program 1 times [2025-02-06 12:16:53,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:53,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614561046] [2025-02-06 12:16:53,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:53,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:53,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:16:53,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:16:53,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:53,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:16:53,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:53,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614561046] [2025-02-06 12:16:53,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614561046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:53,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:53,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:16:53,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045875976] [2025-02-06 12:16:53,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:53,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:16:53,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:53,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:16:53,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:16:53,205 INFO L87 Difference]: Start difference. First operand 4703 states and 6912 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:54,761 INFO L93 Difference]: Finished difference Result 7482 states and 10909 transitions. [2025-02-06 12:16:54,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:16:54,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-02-06 12:16:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:54,782 INFO L225 Difference]: With dead ends: 7482 [2025-02-06 12:16:54,782 INFO L226 Difference]: Without dead ends: 7482 [2025-02-06 12:16:54,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:16:54,783 INFO L435 NwaCegarLoop]: 3720 mSDtfsCounter, 2338 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2342 SdHoareTripleChecker+Valid, 5416 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:54,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2342 Valid, 5416 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 12:16:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7482 states. [2025-02-06 12:16:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7482 to 5249. [2025-02-06 12:16:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5249 states, 4379 states have (on average 1.7857958437999544) internal successors, (7820), 5224 states have internal predecessors, (7820), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:16:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5249 states to 5249 states and 7870 transitions. [2025-02-06 12:16:54,901 INFO L78 Accepts]: Start accepts. Automaton has 5249 states and 7870 transitions. Word has length 9 [2025-02-06 12:16:54,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:54,901 INFO L471 AbstractCegarLoop]: Abstraction has 5249 states and 7870 transitions. [2025-02-06 12:16:54,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 5249 states and 7870 transitions. [2025-02-06 12:16:54,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 12:16:54,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:54,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:16:54,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:16:54,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr345REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:16:54,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:54,903 INFO L85 PathProgramCache]: Analyzing trace with hash -780199562, now seen corresponding path program 1 times [2025-02-06 12:16:54,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:54,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193320223] [2025-02-06 12:16:54,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:54,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:54,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:16:54,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:16:54,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:54,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:16:54,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:54,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193320223] [2025-02-06 12:16:54,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193320223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:54,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:54,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:16:54,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143891738] [2025-02-06 12:16:54,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:54,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:16:54,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:54,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:16:54,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:16:54,976 INFO L87 Difference]: Start difference. First operand 5249 states and 7870 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:55,480 INFO L93 Difference]: Finished difference Result 7267 states and 10665 transitions. [2025-02-06 12:16:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:16:55,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 12:16:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:55,498 INFO L225 Difference]: With dead ends: 7267 [2025-02-06 12:16:55,499 INFO L226 Difference]: Without dead ends: 7267 [2025-02-06 12:16:55,499 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-02-06 12:16:55,500 INFO L435 NwaCegarLoop]: 3111 mSDtfsCounter, 1457 mSDsluCounter, 5860 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1463 SdHoareTripleChecker+Valid, 8971 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:55,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1463 Valid, 8971 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:16:55,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7267 states. [2025-02-06 12:16:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7267 to 5252. [2025-02-06 12:16:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5252 states, 4382 states have (on average 1.785257873117298) internal successors, (7823), 5227 states have internal predecessors, (7823), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:16:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 7873 transitions. [2025-02-06 12:16:55,598 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 7873 transitions. Word has length 12 [2025-02-06 12:16:55,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:55,599 INFO L471 AbstractCegarLoop]: Abstraction has 5252 states and 7873 transitions. [2025-02-06 12:16:55,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 7873 transitions. [2025-02-06 12:16:55,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 12:16:55,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:55,600 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] [2025-02-06 12:16:55,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:16:55,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr967REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:16:55,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:55,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1296824834, now seen corresponding path program 1 times [2025-02-06 12:16:55,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:55,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465427513] [2025-02-06 12:16:55,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:55,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:55,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:16:55,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:16:55,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:55,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:16:55,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:55,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465427513] [2025-02-06 12:16:55,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465427513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:55,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:55,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:16:55,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652211979] [2025-02-06 12:16:55,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:55,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:16:55,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:55,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:16:55,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:16:55,681 INFO L87 Difference]: Start difference. First operand 5252 states and 7873 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:57,322 INFO L93 Difference]: Finished difference Result 5327 states and 7979 transitions. [2025-02-06 12:16:57,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:16:57,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 12:16:57,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:57,335 INFO L225 Difference]: With dead ends: 5327 [2025-02-06 12:16:57,336 INFO L226 Difference]: Without dead ends: 5327 [2025-02-06 12:16:57,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:16:57,337 INFO L435 NwaCegarLoop]: 1927 mSDtfsCounter, 3123 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3133 SdHoareTripleChecker+Valid, 3740 SdHoareTripleChecker+Invalid, 2272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:57,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3133 Valid, 3740 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2240 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 12:16:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5327 states. [2025-02-06 12:16:57,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5327 to 5229. [2025-02-06 12:16:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5229 states, 4382 states have (on average 1.7747603833865815) internal successors, (7777), 5204 states have internal predecessors, (7777), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:16:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5229 states to 5229 states and 7827 transitions. [2025-02-06 12:16:57,416 INFO L78 Accepts]: Start accepts. Automaton has 5229 states and 7827 transitions. Word has length 21 [2025-02-06 12:16:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:57,417 INFO L471 AbstractCegarLoop]: Abstraction has 5229 states and 7827 transitions. [2025-02-06 12:16:57,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 5229 states and 7827 transitions. [2025-02-06 12:16:57,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 12:16:57,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:57,420 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] [2025-02-06 12:16:57,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:16:57,420 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr968REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:16:57,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:57,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1296824835, now seen corresponding path program 1 times [2025-02-06 12:16:57,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:57,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640442050] [2025-02-06 12:16:57,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:57,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:57,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:16:57,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:16:57,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:57,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:57,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:16:57,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:57,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640442050] [2025-02-06 12:16:57,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640442050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:57,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:57,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:16:57,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430405358] [2025-02-06 12:16:57,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:57,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:16:57,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:57,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:16:57,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:16:57,516 INFO L87 Difference]: Start difference. First operand 5229 states and 7827 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:57,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:57,752 INFO L93 Difference]: Finished difference Result 5091 states and 7621 transitions. [2025-02-06 12:16:57,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:16:57,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 12:16:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:57,765 INFO L225 Difference]: With dead ends: 5091 [2025-02-06 12:16:57,765 INFO L226 Difference]: Without dead ends: 5091 [2025-02-06 12:16:57,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:16:57,766 INFO L435 NwaCegarLoop]: 2767 mSDtfsCounter, 60 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 5481 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:57,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 5481 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:16:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5091 states. [2025-02-06 12:16:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5091 to 5091. [2025-02-06 12:16:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5091 states, 4256 states have (on average 1.7789003759398496) internal successors, (7571), 5066 states have internal predecessors, (7571), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:16:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 7621 transitions. [2025-02-06 12:16:57,833 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 7621 transitions. Word has length 21 [2025-02-06 12:16:57,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:57,833 INFO L471 AbstractCegarLoop]: Abstraction has 5091 states and 7621 transitions. [2025-02-06 12:16:57,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 7621 transitions. [2025-02-06 12:16:57,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 12:16:57,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:57,834 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] [2025-02-06 12:16:57,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:16:57,834 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr660REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:16:57,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:57,835 INFO L85 PathProgramCache]: Analyzing trace with hash 529563616, now seen corresponding path program 1 times [2025-02-06 12:16:57,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:57,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315932842] [2025-02-06 12:16:57,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:57,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:57,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:16:57,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:16:57,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:57,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:16:57,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:57,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315932842] [2025-02-06 12:16:57,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315932842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:57,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:57,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:16:57,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28592601] [2025-02-06 12:16:57,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:57,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:16:57,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:57,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:16:57,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:16:57,936 INFO L87 Difference]: Start difference. First operand 5091 states and 7621 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:58,309 INFO L93 Difference]: Finished difference Result 7008 states and 10286 transitions. [2025-02-06 12:16:58,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:16:58,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 12:16:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:58,325 INFO L225 Difference]: With dead ends: 7008 [2025-02-06 12:16:58,325 INFO L226 Difference]: Without dead ends: 7008 [2025-02-06 12:16:58,325 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-02-06 12:16:58,326 INFO L435 NwaCegarLoop]: 3047 mSDtfsCounter, 1320 mSDsluCounter, 5680 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 8727 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:58,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 8727 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:16:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7008 states. [2025-02-06 12:16:58,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7008 to 5101. [2025-02-06 12:16:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5101 states, 4266 states have (on average 1.7770745428973278) internal successors, (7581), 5076 states have internal predecessors, (7581), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:16:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5101 states to 5101 states and 7631 transitions. [2025-02-06 12:16:58,392 INFO L78 Accepts]: Start accepts. Automaton has 5101 states and 7631 transitions. Word has length 21 [2025-02-06 12:16:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:58,392 INFO L471 AbstractCegarLoop]: Abstraction has 5101 states and 7631 transitions. [2025-02-06 12:16:58,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 5101 states and 7631 transitions. [2025-02-06 12:16:58,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 12:16:58,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:58,393 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] [2025-02-06 12:16:58,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:16:58,393 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr944REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:16:58,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:58,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1546742448, now seen corresponding path program 1 times [2025-02-06 12:16:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:58,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924655177] [2025-02-06 12:16:58,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:58,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:58,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:16:58,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:16:58,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:58,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:16:58,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:58,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924655177] [2025-02-06 12:16:58,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924655177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:58,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:58,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:16:58,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686777460] [2025-02-06 12:16:58,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:58,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:16:58,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:58,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:16:58,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:16:58,506 INFO L87 Difference]: Start difference. First operand 5101 states and 7631 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:58,790 INFO L93 Difference]: Finished difference Result 5078 states and 7587 transitions. [2025-02-06 12:16:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:16:58,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-06 12:16:58,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:58,802 INFO L225 Difference]: With dead ends: 5078 [2025-02-06 12:16:58,803 INFO L226 Difference]: Without dead ends: 5078 [2025-02-06 12:16:58,803 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-02-06 12:16:58,804 INFO L435 NwaCegarLoop]: 2729 mSDtfsCounter, 45 mSDsluCounter, 5435 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8164 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:58,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8164 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:16:58,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2025-02-06 12:16:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 5078. [2025-02-06 12:16:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5078 states, 4250 states have (on average 1.7734117647058822) internal successors, (7537), 5053 states have internal predecessors, (7537), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:16:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5078 states to 5078 states and 7587 transitions. [2025-02-06 12:16:58,869 INFO L78 Accepts]: Start accepts. Automaton has 5078 states and 7587 transitions. Word has length 22 [2025-02-06 12:16:58,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:58,869 INFO L471 AbstractCegarLoop]: Abstraction has 5078 states and 7587 transitions. [2025-02-06 12:16:58,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 5078 states and 7587 transitions. [2025-02-06 12:16:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 12:16:58,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:58,870 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] [2025-02-06 12:16:58,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:16:58,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr930REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:16:58,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash 15554502, now seen corresponding path program 1 times [2025-02-06 12:16:58,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:58,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18290697] [2025-02-06 12:16:58,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:58,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:58,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 12:16:58,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 12:16:58,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:58,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:59,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:16:59,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:59,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18290697] [2025-02-06 12:16:59,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18290697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:59,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:59,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:16:59,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772253840] [2025-02-06 12:16:59,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:59,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:16:59,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:59,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:16:59,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:16:59,049 INFO L87 Difference]: Start difference. First operand 5078 states and 7587 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:17:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:00,914 INFO L93 Difference]: Finished difference Result 7405 states and 10770 transitions. [2025-02-06 12:17:00,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:17:00,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-06 12:17:00,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:00,931 INFO L225 Difference]: With dead ends: 7405 [2025-02-06 12:17:00,931 INFO L226 Difference]: Without dead ends: 7405 [2025-02-06 12:17:00,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:17:00,932 INFO L435 NwaCegarLoop]: 2199 mSDtfsCounter, 2337 mSDsluCounter, 3479 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2341 SdHoareTripleChecker+Valid, 5678 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:00,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2341 Valid, 5678 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2704 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 12:17:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7405 states. [2025-02-06 12:17:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7405 to 5074. [2025-02-06 12:17:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5074 states, 4250 states have (on average 1.7715294117647058) internal successors, (7529), 5049 states have internal predecessors, (7529), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:17:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5074 states to 5074 states and 7579 transitions. [2025-02-06 12:17:01,006 INFO L78 Accepts]: Start accepts. Automaton has 5074 states and 7579 transitions. Word has length 36 [2025-02-06 12:17:01,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:01,007 INFO L471 AbstractCegarLoop]: Abstraction has 5074 states and 7579 transitions. [2025-02-06 12:17:01,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:17:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 5074 states and 7579 transitions. [2025-02-06 12:17:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 12:17:01,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:01,010 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] [2025-02-06 12:17:01,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:17:01,010 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr916REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:17:01,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:01,011 INFO L85 PathProgramCache]: Analyzing trace with hash -94687070, now seen corresponding path program 1 times [2025-02-06 12:17:01,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:01,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000751055] [2025-02-06 12:17:01,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:01,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 12:17:01,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 12:17:01,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:01,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:17:01,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:01,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000751055] [2025-02-06 12:17:01,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000751055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:01,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:01,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:17:01,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423609174] [2025-02-06 12:17:01,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:01,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:17:01,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:01,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:17:01,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:17:01,177 INFO L87 Difference]: Start difference. First operand 5074 states and 7579 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:17:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:01,464 INFO L93 Difference]: Finished difference Result 5062 states and 7559 transitions. [2025-02-06 12:17:01,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:17:01,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 71 [2025-02-06 12:17:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:01,473 INFO L225 Difference]: With dead ends: 5062 [2025-02-06 12:17:01,474 INFO L226 Difference]: Without dead ends: 5062 [2025-02-06 12:17:01,474 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-02-06 12:17:01,474 INFO L435 NwaCegarLoop]: 2727 mSDtfsCounter, 21 mSDsluCounter, 5423 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8150 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:01,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8150 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:17:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5062 states. [2025-02-06 12:17:01,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5062 to 5062. [2025-02-06 12:17:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5062 states, 4238 states have (on average 1.7718263331760264) internal successors, (7509), 5037 states have internal predecessors, (7509), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:17:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5062 states to 5062 states and 7559 transitions. [2025-02-06 12:17:01,529 INFO L78 Accepts]: Start accepts. Automaton has 5062 states and 7559 transitions. Word has length 71 [2025-02-06 12:17:01,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:01,529 INFO L471 AbstractCegarLoop]: Abstraction has 5062 states and 7559 transitions. [2025-02-06 12:17:01,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:17:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 5062 states and 7559 transitions. [2025-02-06 12:17:01,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-06 12:17:01,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:01,535 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] [2025-02-06 12:17:01,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:17:01,535 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr916REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:17:01,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:01,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1681797798, now seen corresponding path program 1 times [2025-02-06 12:17:01,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:01,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264057383] [2025-02-06 12:17:01,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:01,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:01,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-06 12:17:01,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-06 12:17:01,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:01,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:17:01,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:01,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264057383] [2025-02-06 12:17:01,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264057383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:01,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:01,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:17:01,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231282914] [2025-02-06 12:17:01,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:01,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:17:01,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:01,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:17:01,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:17:01,660 INFO L87 Difference]: Start difference. First operand 5062 states and 7559 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:17:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:02,039 INFO L93 Difference]: Finished difference Result 6576 states and 9748 transitions. [2025-02-06 12:17:02,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:17:02,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2025-02-06 12:17:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:02,053 INFO L225 Difference]: With dead ends: 6576 [2025-02-06 12:17:02,054 INFO L226 Difference]: Without dead ends: 6576 [2025-02-06 12:17:02,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:17:02,054 INFO L435 NwaCegarLoop]: 2743 mSDtfsCounter, 1088 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 5422 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:02,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 5422 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:17:02,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6576 states. [2025-02-06 12:17:02,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6576 to 5919. [2025-02-06 12:17:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5919 states, 5091 states have (on average 1.7542722451384796) internal successors, (8931), 5890 states have internal predecessors, (8931), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 12:17:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5919 states to 5919 states and 8989 transitions. [2025-02-06 12:17:02,122 INFO L78 Accepts]: Start accepts. Automaton has 5919 states and 8989 transitions. Word has length 79 [2025-02-06 12:17:02,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:02,123 INFO L471 AbstractCegarLoop]: Abstraction has 5919 states and 8989 transitions. [2025-02-06 12:17:02,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:17:02,123 INFO L276 IsEmpty]: Start isEmpty. Operand 5919 states and 8989 transitions. [2025-02-06 12:17:02,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 12:17:02,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:02,124 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-02-06 12:17:02,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:17:02,124 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr886REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:17:02,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:02,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1644076863, now seen corresponding path program 1 times [2025-02-06 12:17:02,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:02,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299312347] [2025-02-06 12:17:02,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:02,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:02,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 12:17:02,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 12:17:02,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:02,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:17:02,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:02,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299312347] [2025-02-06 12:17:02,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299312347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:02,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:02,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:17:02,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778226353] [2025-02-06 12:17:02,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:02,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:17:02,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:02,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:17:02,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:17:02,714 INFO L87 Difference]: Start difference. First operand 5919 states and 8989 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 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-02-06 12:17:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:04,958 INFO L93 Difference]: Finished difference Result 5835 states and 8790 transitions. [2025-02-06 12:17:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:17:04,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 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-02-06 12:17:04,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:04,967 INFO L225 Difference]: With dead ends: 5835 [2025-02-06 12:17:04,967 INFO L226 Difference]: Without dead ends: 5835 [2025-02-06 12:17:04,967 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-02-06 12:17:04,968 INFO L435 NwaCegarLoop]: 1460 mSDtfsCounter, 2659 mSDsluCounter, 2875 mSDsCounter, 0 mSdLazyCounter, 4021 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2669 SdHoareTripleChecker+Valid, 4335 SdHoareTripleChecker+Invalid, 4114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 4021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:04,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2669 Valid, 4335 Invalid, 4114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 4021 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 12:17:04,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2025-02-06 12:17:05,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 5279. [2025-02-06 12:17:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5279 states, 4535 states have (on average 1.7098125689084895) internal successors, (7754), 5250 states have internal predecessors, (7754), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 12:17:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5279 states to 5279 states and 7812 transitions. [2025-02-06 12:17:05,033 INFO L78 Accepts]: Start accepts. Automaton has 5279 states and 7812 transitions. Word has length 82 [2025-02-06 12:17:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:05,033 INFO L471 AbstractCegarLoop]: Abstraction has 5279 states and 7812 transitions. [2025-02-06 12:17:05,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 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-02-06 12:17:05,033 INFO L276 IsEmpty]: Start isEmpty. Operand 5279 states and 7812 transitions. [2025-02-06 12:17:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 12:17:05,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:05,034 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] [2025-02-06 12:17:05,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:17:05,034 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr879REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:17:05,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:05,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1120449564, now seen corresponding path program 1 times [2025-02-06 12:17:05,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:05,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329834788] [2025-02-06 12:17:05,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:05,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:05,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 12:17:05,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 12:17:05,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:05,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:05,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:17:05,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:05,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329834788] [2025-02-06 12:17:05,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329834788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:05,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:05,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:17:05,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536099452] [2025-02-06 12:17:05,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:05,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:17:05,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:05,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:17:05,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:17:05,310 INFO L87 Difference]: Start difference. First operand 5279 states and 7812 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:17:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:06,698 INFO L93 Difference]: Finished difference Result 5278 states and 7810 transitions. [2025-02-06 12:17:06,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:17:06,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 87 [2025-02-06 12:17:06,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:06,705 INFO L225 Difference]: With dead ends: 5278 [2025-02-06 12:17:06,705 INFO L226 Difference]: Without dead ends: 5278 [2025-02-06 12:17:06,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:17:06,707 INFO L435 NwaCegarLoop]: 2653 mSDtfsCounter, 2 mSDsluCounter, 5474 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8127 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:06,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8127 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2936 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 12:17:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5278 states. [2025-02-06 12:17:06,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5278 to 5278. [2025-02-06 12:17:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5278 states, 4535 states have (on average 1.7093715545755237) internal successors, (7752), 5249 states have internal predecessors, (7752), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 12:17:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5278 states to 5278 states and 7810 transitions. [2025-02-06 12:17:06,767 INFO L78 Accepts]: Start accepts. Automaton has 5278 states and 7810 transitions. Word has length 87 [2025-02-06 12:17:06,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:06,768 INFO L471 AbstractCegarLoop]: Abstraction has 5278 states and 7810 transitions. [2025-02-06 12:17:06,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:17:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 5278 states and 7810 transitions. [2025-02-06 12:17:06,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 12:17:06,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:06,769 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] [2025-02-06 12:17:06,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:17:06,769 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr880REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:17:06,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:06,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1120449563, now seen corresponding path program 1 times [2025-02-06 12:17:06,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:06,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532965040] [2025-02-06 12:17:06,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:06,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:06,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 12:17:06,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 12:17:06,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:06,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:17:07,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:07,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532965040] [2025-02-06 12:17:07,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532965040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:07,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:07,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:17:07,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70356932] [2025-02-06 12:17:07,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:07,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:17:07,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:07,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:17:07,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:17:07,262 INFO L87 Difference]: Start difference. First operand 5278 states and 7810 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:17:09,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:09,180 INFO L93 Difference]: Finished difference Result 5277 states and 7808 transitions. [2025-02-06 12:17:09,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:17:09,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 87 [2025-02-06 12:17:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:09,184 INFO L225 Difference]: With dead ends: 5277 [2025-02-06 12:17:09,185 INFO L226 Difference]: Without dead ends: 5277 [2025-02-06 12:17:09,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:17:09,185 INFO L435 NwaCegarLoop]: 2653 mSDtfsCounter, 1 mSDsluCounter, 5448 mSDsCounter, 0 mSdLazyCounter, 2959 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8101 SdHoareTripleChecker+Invalid, 2960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:09,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8101 Invalid, 2960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2959 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 12:17:09,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5277 states. [2025-02-06 12:17:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5277 to 5277. [2025-02-06 12:17:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5277 states, 4533 states have (on average 1.7096845356276196) internal successors, (7750), 5248 states have internal predecessors, (7750), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 12:17:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5277 states to 5277 states and 7808 transitions. [2025-02-06 12:17:09,238 INFO L78 Accepts]: Start accepts. Automaton has 5277 states and 7808 transitions. Word has length 87 [2025-02-06 12:17:09,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:09,238 INFO L471 AbstractCegarLoop]: Abstraction has 5277 states and 7808 transitions. [2025-02-06 12:17:09,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:17:09,238 INFO L276 IsEmpty]: Start isEmpty. Operand 5277 states and 7808 transitions. [2025-02-06 12:17:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 12:17:09,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:09,241 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] [2025-02-06 12:17:09,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:17:09,242 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr875REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:17:09,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:09,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1947566207, now seen corresponding path program 1 times [2025-02-06 12:17:09,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:09,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793365225] [2025-02-06 12:17:09,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:09,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:09,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:17:09,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:17:09,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:09,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:17:09,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:09,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793365225] [2025-02-06 12:17:09,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793365225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:09,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:09,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:17:09,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331535074] [2025-02-06 12:17:09,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:09,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:17:09,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:09,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:17:09,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:17:09,469 INFO L87 Difference]: Start difference. First operand 5277 states and 7808 transitions. Second operand has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:17:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:11,434 INFO L93 Difference]: Finished difference Result 5295 states and 7843 transitions. [2025-02-06 12:17:11,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:17:11,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 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 95 [2025-02-06 12:17:11,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:11,443 INFO L225 Difference]: With dead ends: 5295 [2025-02-06 12:17:11,444 INFO L226 Difference]: Without dead ends: 5295 [2025-02-06 12:17:11,444 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-02-06 12:17:11,444 INFO L435 NwaCegarLoop]: 2617 mSDtfsCounter, 27 mSDsluCounter, 8310 mSDsCounter, 0 mSdLazyCounter, 2905 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10927 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:11,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 10927 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2905 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 12:17:11,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2025-02-06 12:17:11,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5286. [2025-02-06 12:17:11,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5286 states, 4541 states have (on average 1.7090949130147544) internal successors, (7761), 5255 states have internal predecessors, (7761), 29 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (43), 28 states have call predecessors, (43), 29 states have call successors, (43) [2025-02-06 12:17:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5286 states to 5286 states and 7833 transitions. [2025-02-06 12:17:11,516 INFO L78 Accepts]: Start accepts. Automaton has 5286 states and 7833 transitions. Word has length 95 [2025-02-06 12:17:11,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:11,517 INFO L471 AbstractCegarLoop]: Abstraction has 5286 states and 7833 transitions. [2025-02-06 12:17:11,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:17:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 5286 states and 7833 transitions. [2025-02-06 12:17:11,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 12:17:11,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:11,518 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] [2025-02-06 12:17:11,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:17:11,518 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr876REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:17:11,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:11,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1947566206, now seen corresponding path program 1 times [2025-02-06 12:17:11,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:11,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712316852] [2025-02-06 12:17:11,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:11,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:11,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:17:11,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:17:11,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:11,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:17:11,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:11,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712316852] [2025-02-06 12:17:11,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712316852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:11,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:11,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:17:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448022232] [2025-02-06 12:17:11,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:11,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:17:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:11,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:17:11,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:17:11,998 INFO L87 Difference]: Start difference. First operand 5286 states and 7833 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:17:14,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:14,133 INFO L93 Difference]: Finished difference Result 5286 states and 7831 transitions. [2025-02-06 12:17:14,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:17:14,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 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 95 [2025-02-06 12:17:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:14,142 INFO L225 Difference]: With dead ends: 5286 [2025-02-06 12:17:14,142 INFO L226 Difference]: Without dead ends: 5286 [2025-02-06 12:17:14,142 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-02-06 12:17:14,143 INFO L435 NwaCegarLoop]: 2624 mSDtfsCounter, 22 mSDsluCounter, 7721 mSDsCounter, 0 mSdLazyCounter, 3447 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10345 SdHoareTripleChecker+Invalid, 3456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:14,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10345 Invalid, 3456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3447 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 12:17:14,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5286 states. [2025-02-06 12:17:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5286 to 5286. [2025-02-06 12:17:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5286 states, 4541 states have (on average 1.708654481391764) internal successors, (7759), 5255 states have internal predecessors, (7759), 29 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (43), 28 states have call predecessors, (43), 29 states have call successors, (43) [2025-02-06 12:17:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5286 states to 5286 states and 7831 transitions. [2025-02-06 12:17:14,216 INFO L78 Accepts]: Start accepts. Automaton has 5286 states and 7831 transitions. Word has length 95 [2025-02-06 12:17:14,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:14,217 INFO L471 AbstractCegarLoop]: Abstraction has 5286 states and 7831 transitions. [2025-02-06 12:17:14,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:17:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5286 states and 7831 transitions. [2025-02-06 12:17:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 12:17:14,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:14,218 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-02-06 12:17:14,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:17:14,218 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr875REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:17:14,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:14,219 INFO L85 PathProgramCache]: Analyzing trace with hash -70072752, now seen corresponding path program 1 times [2025-02-06 12:17:14,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:14,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409588181] [2025-02-06 12:17:14,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:14,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:14,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 12:17:14,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 12:17:14,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:14,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:17:14,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:14,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409588181] [2025-02-06 12:17:14,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409588181] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:14,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747034557] [2025-02-06 12:17:14,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:14,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:14,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:17:14,669 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:17:14,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:17:14,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 12:17:14,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 12:17:14,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:14,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:14,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 12:17:14,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:17:14,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:17:15,138 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:17:15,139 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-02-06 12:17:15,182 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-02-06 12:17:15,261 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-02-06 12:17:15,444 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:15,445 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-02-06 12:17:15,497 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-02-06 12:17:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:17:15,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:17:15,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747034557] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:15,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:17:15,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-02-06 12:17:15,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877651256] [2025-02-06 12:17:15,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:17:15,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:17:15,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:15,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:17:15,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=318, Unknown=6, NotChecked=0, Total=380 [2025-02-06 12:17:15,588 INFO L87 Difference]: Start difference. First operand 5286 states and 7831 transitions. Second operand has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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-02-06 12:17:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:21,428 INFO L93 Difference]: Finished difference Result 5293 states and 7837 transitions. [2025-02-06 12:17:21,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:17:21,429 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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 96 [2025-02-06 12:17:21,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:21,435 INFO L225 Difference]: With dead ends: 5293 [2025-02-06 12:17:21,435 INFO L226 Difference]: Without dead ends: 5293 [2025-02-06 12:17:21,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=463, Unknown=6, NotChecked=0, Total=552 [2025-02-06 12:17:21,435 INFO L435 NwaCegarLoop]: 1802 mSDtfsCounter, 2669 mSDsluCounter, 21361 mSDsCounter, 0 mSdLazyCounter, 12786 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2687 SdHoareTripleChecker+Valid, 23163 SdHoareTripleChecker+Invalid, 12811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 12786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:21,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2687 Valid, 23163 Invalid, 12811 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 12786 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-02-06 12:17:21,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2025-02-06 12:17:21,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 5290. [2025-02-06 12:17:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5290 states, 4545 states have (on average 1.7078107810781078) internal successors, (7762), 5258 states have internal predecessors, (7762), 29 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (31), 28 states have call predecessors, (31), 29 states have call successors, (31) [2025-02-06 12:17:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 7822 transitions. [2025-02-06 12:17:21,498 INFO L78 Accepts]: Start accepts. Automaton has 5290 states and 7822 transitions. Word has length 96 [2025-02-06 12:17:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:21,498 INFO L471 AbstractCegarLoop]: Abstraction has 5290 states and 7822 transitions. [2025-02-06 12:17:21,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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-02-06 12:17:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 5290 states and 7822 transitions. [2025-02-06 12:17:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 12:17:21,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:21,500 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-02-06 12:17:21,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:17:21,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:21,704 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr876REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:17:21,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:21,704 INFO L85 PathProgramCache]: Analyzing trace with hash -70072751, now seen corresponding path program 1 times [2025-02-06 12:17:21,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:21,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565916341] [2025-02-06 12:17:21,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:21,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:21,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 12:17:21,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 12:17:21,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:21,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:17:22,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:22,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565916341] [2025-02-06 12:17:22,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565916341] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:22,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469690935] [2025-02-06 12:17:22,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:22,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:22,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:17:22,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:17:22,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:17:22,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 12:17:22,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 12:17:22,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:22,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:22,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 12:17:22,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:17:22,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:17:22,890 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:17:22,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:17:22,896 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-02-06 12:17:22,909 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-02-06 12:17:22,912 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-02-06 12:17:22,971 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-02-06 12:17:22,975 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-02-06 12:17:23,067 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:23,067 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-02-06 12:17:23,075 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-02-06 12:17:23,097 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-02-06 12:17:23,101 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-02-06 12:17:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:17:23,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:17:23,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469690935] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:23,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:17:23,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-02-06 12:17:23,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783039381] [2025-02-06 12:17:23,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:17:23,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:17:23,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:23,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:17:23,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=246, Unknown=8, NotChecked=0, Total=306 [2025-02-06 12:17:23,260 INFO L87 Difference]: Start difference. First operand 5290 states and 7822 transitions. Second operand has 15 states, 12 states have (on average 12.083333333333334) internal successors, (145), 15 states have internal predecessors, (145), 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-02-06 12:17:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:28,554 INFO L93 Difference]: Finished difference Result 5292 states and 7835 transitions. [2025-02-06 12:17:28,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:17:28,555 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 12.083333333333334) internal successors, (145), 15 states have internal predecessors, (145), 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 96 [2025-02-06 12:17:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:28,562 INFO L225 Difference]: With dead ends: 5292 [2025-02-06 12:17:28,562 INFO L226 Difference]: Without dead ends: 5292 [2025-02-06 12:17:28,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=372, Unknown=9, NotChecked=0, Total=462 [2025-02-06 12:17:28,563 INFO L435 NwaCegarLoop]: 1808 mSDtfsCounter, 2668 mSDsluCounter, 14171 mSDsCounter, 0 mSdLazyCounter, 11604 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2686 SdHoareTripleChecker+Valid, 15979 SdHoareTripleChecker+Invalid, 11630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 11604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:28,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2686 Valid, 15979 Invalid, 11630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 11604 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-06 12:17:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5292 states. [2025-02-06 12:17:28,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5292 to 5280. [2025-02-06 12:17:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5280 states, 4537 states have (on average 1.7083976195724047) internal successors, (7751), 5250 states have internal predecessors, (7751), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 12:17:28,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5280 states to 5280 states and 7809 transitions. [2025-02-06 12:17:28,626 INFO L78 Accepts]: Start accepts. Automaton has 5280 states and 7809 transitions. Word has length 96 [2025-02-06 12:17:28,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:28,627 INFO L471 AbstractCegarLoop]: Abstraction has 5280 states and 7809 transitions. [2025-02-06 12:17:28,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 12.083333333333334) internal successors, (145), 15 states have internal predecessors, (145), 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-02-06 12:17:28,627 INFO L276 IsEmpty]: Start isEmpty. Operand 5280 states and 7809 transitions. [2025-02-06 12:17:28,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 12:17:28,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:28,628 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, 1, 1] [2025-02-06 12:17:28,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:17:28,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:28,829 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr872REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:17:28,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:28,830 INFO L85 PathProgramCache]: Analyzing trace with hash 771274067, now seen corresponding path program 1 times [2025-02-06 12:17:28,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:28,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032262368] [2025-02-06 12:17:28,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:28,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:28,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:17:28,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:17:28,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:28,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:29,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:17:29,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:29,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032262368] [2025-02-06 12:17:29,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032262368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:29,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:29,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 12:17:29,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628135245] [2025-02-06 12:17:29,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:29,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:17:29,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:29,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:17:29,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:17:29,463 INFO L87 Difference]: Start difference. First operand 5280 states and 7809 transitions. Second operand has 11 states, 10 states have (on average 9.6) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:17:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:33,526 INFO L93 Difference]: Finished difference Result 5299 states and 7843 transitions. [2025-02-06 12:17:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:17:33,527 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.6) internal successors, (96), 11 states have internal predecessors, (96), 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 98 [2025-02-06 12:17:33,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:33,534 INFO L225 Difference]: With dead ends: 5299 [2025-02-06 12:17:33,534 INFO L226 Difference]: Without dead ends: 5299 [2025-02-06 12:17:33,534 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-02-06 12:17:33,535 INFO L435 NwaCegarLoop]: 1809 mSDtfsCounter, 2700 mSDsluCounter, 10643 mSDsCounter, 0 mSdLazyCounter, 9666 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2718 SdHoareTripleChecker+Valid, 12452 SdHoareTripleChecker+Invalid, 9688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 9666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:33,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2718 Valid, 12452 Invalid, 9688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 9666 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-06 12:17:33,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2025-02-06 12:17:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 5295. [2025-02-06 12:17:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5295 states, 4551 states have (on average 1.7068776093166338) internal successors, (7768), 5263 states have internal predecessors, (7768), 29 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (31), 28 states have call predecessors, (31), 29 states have call successors, (31) [2025-02-06 12:17:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5295 states to 5295 states and 7828 transitions. [2025-02-06 12:17:33,588 INFO L78 Accepts]: Start accepts. Automaton has 5295 states and 7828 transitions. Word has length 98 [2025-02-06 12:17:33,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:33,588 INFO L471 AbstractCegarLoop]: Abstraction has 5295 states and 7828 transitions. [2025-02-06 12:17:33,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.6) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:17:33,588 INFO L276 IsEmpty]: Start isEmpty. Operand 5295 states and 7828 transitions. [2025-02-06 12:17:33,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 12:17:33,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:33,589 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, 1, 1] [2025-02-06 12:17:33,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 12:17:33,589 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr871REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:17:33,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:33,590 INFO L85 PathProgramCache]: Analyzing trace with hash 771274066, now seen corresponding path program 1 times [2025-02-06 12:17:33,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:33,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639533575] [2025-02-06 12:17:33,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:33,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:33,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:17:33,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:17:33,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:33,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:17:34,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:34,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639533575] [2025-02-06 12:17:34,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639533575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:34,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:34,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 12:17:34,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079965288] [2025-02-06 12:17:34,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:34,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:17:34,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:34,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:17:34,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:17:34,023 INFO L87 Difference]: Start difference. First operand 5295 states and 7828 transitions. Second operand has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:17:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:37,446 INFO L93 Difference]: Finished difference Result 5298 states and 7841 transitions. [2025-02-06 12:17:37,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:17:37,447 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 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 98 [2025-02-06 12:17:37,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:37,457 INFO L225 Difference]: With dead ends: 5298 [2025-02-06 12:17:37,457 INFO L226 Difference]: Without dead ends: 5298 [2025-02-06 12:17:37,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-02-06 12:17:37,460 INFO L435 NwaCegarLoop]: 1803 mSDtfsCounter, 2701 mSDsluCounter, 14251 mSDsCounter, 0 mSdLazyCounter, 8849 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2719 SdHoareTripleChecker+Valid, 16054 SdHoareTripleChecker+Invalid, 8873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 8849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:37,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2719 Valid, 16054 Invalid, 8873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 8849 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-06 12:17:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5298 states. [2025-02-06 12:17:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5298 to 5295. [2025-02-06 12:17:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5295 states, 4551 states have (on average 1.7064381454625357) internal successors, (7766), 5263 states have internal predecessors, (7766), 29 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (31), 28 states have call predecessors, (31), 29 states have call successors, (31) [2025-02-06 12:17:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5295 states to 5295 states and 7826 transitions. [2025-02-06 12:17:37,520 INFO L78 Accepts]: Start accepts. Automaton has 5295 states and 7826 transitions. Word has length 98 [2025-02-06 12:17:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:37,520 INFO L471 AbstractCegarLoop]: Abstraction has 5295 states and 7826 transitions. [2025-02-06 12:17:37,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:17:37,521 INFO L276 IsEmpty]: Start isEmpty. Operand 5295 states and 7826 transitions. [2025-02-06 12:17:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 12:17:37,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:37,521 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, 1, 1, 1] [2025-02-06 12:17:37,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 12:17:37,522 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr872REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:17:37,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:37,522 INFO L85 PathProgramCache]: Analyzing trace with hash -180303836, now seen corresponding path program 1 times [2025-02-06 12:17:37,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:37,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430591426] [2025-02-06 12:17:37,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:37,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:37,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:17:37,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:17:37,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:37,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:17:38,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:38,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430591426] [2025-02-06 12:17:38,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430591426] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:38,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875123051] [2025-02-06 12:17:38,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:38,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:38,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:17:38,224 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:17:38,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:17:38,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:17:38,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:17:38,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:38,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:38,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 12:17:38,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:17:38,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:17:38,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:17:38,657 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:17:38,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:17:38,677 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-02-06 12:17:38,687 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-02-06 12:17:38,772 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-02-06 12:17:38,777 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-02-06 12:17:38,890 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:38,890 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-02-06 12:17:38,901 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-02-06 12:17:38,989 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:38,989 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-02-06 12:17:38,998 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-02-06 12:17:39,015 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-02-06 12:17:39,018 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-02-06 12:17:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:17:39,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:17:39,106 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1099 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1098 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:17:39,118 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1098 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1099 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-06 12:17:39,171 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1099 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1105))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1104) .cse0 v_ArrVal_1098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1104) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1105) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2025-02-06 12:17:39,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875123051] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:39,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:17:39,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-02-06 12:17:39,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739408668] [2025-02-06 12:17:39,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:17:39,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 12:17:39,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:39,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 12:17:39,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=398, Unknown=3, NotChecked=126, Total=600 [2025-02-06 12:17:39,175 INFO L87 Difference]: Start difference. First operand 5295 states and 7826 transitions. Second operand has 20 states, 17 states have (on average 9.235294117647058) internal successors, (157), 20 states have internal predecessors, (157), 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-02-06 12:17:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:46,529 INFO L93 Difference]: Finished difference Result 5297 states and 7839 transitions. [2025-02-06 12:17:46,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:17:46,529 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 9.235294117647058) internal successors, (157), 20 states have internal predecessors, (157), 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 99 [2025-02-06 12:17:46,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:46,534 INFO L225 Difference]: With dead ends: 5297 [2025-02-06 12:17:46,534 INFO L226 Difference]: Without dead ends: 5297 [2025-02-06 12:17:46,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=595, Unknown=3, NotChecked=156, Total=870 [2025-02-06 12:17:46,534 INFO L435 NwaCegarLoop]: 1807 mSDtfsCounter, 2686 mSDsluCounter, 17716 mSDsCounter, 0 mSdLazyCounter, 16423 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2704 SdHoareTripleChecker+Valid, 19523 SdHoareTripleChecker+Invalid, 16467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 16423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:46,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2704 Valid, 19523 Invalid, 16467 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 16423 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2025-02-06 12:17:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5297 states. [2025-02-06 12:17:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5297 to 5294. [2025-02-06 12:17:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5294 states, 4551 states have (on average 1.7059986816084378) internal successors, (7764), 5262 states have internal predecessors, (7764), 29 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (31), 28 states have call predecessors, (31), 29 states have call successors, (31) [2025-02-06 12:17:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5294 states to 5294 states and 7824 transitions. [2025-02-06 12:17:46,589 INFO L78 Accepts]: Start accepts. Automaton has 5294 states and 7824 transitions. Word has length 99 [2025-02-06 12:17:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:46,590 INFO L471 AbstractCegarLoop]: Abstraction has 5294 states and 7824 transitions. [2025-02-06 12:17:46,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 9.235294117647058) internal successors, (157), 20 states have internal predecessors, (157), 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-02-06 12:17:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 5294 states and 7824 transitions. [2025-02-06 12:17:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 12:17:46,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:46,591 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, 1, 1, 1] [2025-02-06 12:17:46,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:17:46,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:46,791 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr871REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-02-06 12:17:46,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:46,792 INFO L85 PathProgramCache]: Analyzing trace with hash -180303837, now seen corresponding path program 1 times [2025-02-06 12:17:46,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:46,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83115962] [2025-02-06 12:17:46,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:46,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:46,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:17:46,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:17:46,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:46,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat