./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9885703216edf9cfe4bfb438db591a48e102e73a3e0423f90ce871c05fdf2b57 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:18:50,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:18:50,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:18:50,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:18:50,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:18:50,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:18:50,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:18:50,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:18:50,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:18:50,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:18:50,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:18:50,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:18:50,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:18:50,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:18:50,694 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:18:50,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:18:50,695 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:18:50,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:18:50,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:18:50,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:18:50,695 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:18:50,695 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:18:50,695 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:18:50,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:18:50,695 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:18:50,695 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:18:50,695 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:18:50,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:18:50,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:18:50,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:18:50,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:18:50,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:18:50,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:18:50,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:18:50,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:18:50,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:18:50,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:18:50,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:18:50,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:18:50,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:18:50,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:18:50,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:18:50,696 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9885703216edf9cfe4bfb438db591a48e102e73a3e0423f90ce871c05fdf2b57 [2025-03-04 09:18:50,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:18:50,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:18:50,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:18:50,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:18:50,912 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:18:50,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2025-03-04 09:18:52,031 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/477ce9a88/32999877e7114c56b456c8ecbb13a9da/FLAGe319d9f34 [2025-03-04 09:18:52,336 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:18:52,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2025-03-04 09:18:52,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/477ce9a88/32999877e7114c56b456c8ecbb13a9da/FLAGe319d9f34 [2025-03-04 09:18:52,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/477ce9a88/32999877e7114c56b456c8ecbb13a9da [2025-03-04 09:18:52,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:18:52,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:18:52,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:18:52,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:18:52,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:18:52,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:18:52" (1/1) ... [2025-03-04 09:18:52,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eb3d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:18:52, skipping insertion in model container [2025-03-04 09:18:52,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:18:52" (1/1) ... [2025-03-04 09:18:52,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:18:52,967 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:52,998 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,004 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,008 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,014 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,037 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,039 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,040 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,043 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,063 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,063 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,064 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,064 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,076 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,076 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,077 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,077 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,092 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,093 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,096 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,096 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,108 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,109 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,110 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,110 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:18:53,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:18:53,136 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:18:53,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:18:53,276 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:18:53,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:18:53 WrapperNode [2025-03-04 09:18:53,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:18:53,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:18:53,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:18:53,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:18:53,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:18:53" (1/1) ... [2025-03-04 09:18:53,312 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:18:53" (1/1) ... [2025-03-04 09:18:53,382 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3338 [2025-03-04 09:18:53,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:18:53,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:18:53,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:18:53,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:18:53,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:18:53" (1/1) ... [2025-03-04 09:18:53,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:18:53" (1/1) ... [2025-03-04 09:18:53,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:18:53" (1/1) ... [2025-03-04 09:18:53,522 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 372, 106]. 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, 82, 4]. [2025-03-04 09:18:53,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:18:53" (1/1) ... [2025-03-04 09:18:53,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:18:53" (1/1) ... [2025-03-04 09:18:53,576 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:18:53" (1/1) ... [2025-03-04 09:18:53,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:18:53" (1/1) ... [2025-03-04 09:18:53,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:18:53" (1/1) ... [2025-03-04 09:18:53,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:18:53" (1/1) ... [2025-03-04 09:18:53,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:18:53,619 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:18:53,619 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:18:53,619 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:18:53,621 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:18:53" (1/1) ... [2025-03-04 09:18:53,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:18:53,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:18:53,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:18:53,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:18:53,667 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-03-04 09:18:53,667 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-03-04 09:18:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:18:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:18:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:18:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 09:18:53,668 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 09:18:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:18:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:18:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:18:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 09:18:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 09:18:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 09:18:53,668 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 09:18:53,668 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 09:18:53,668 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 09:18:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:18:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:18:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 09:18:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 09:18:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 09:18:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:18:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 09:18:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 09:18:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 09:18:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:18:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:18:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:18:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:18:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:18:53,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:18:53,870 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:18:53,871 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:18:56,839 INFO L1325 $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-03-04 09:18:57,059 INFO L? ?]: Removed 2487 outVars from TransFormulas that were not future-live. [2025-03-04 09:18:57,059 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:18:57,140 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:18:57,140 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 09:18:57,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:18:57 BoogieIcfgContainer [2025-03-04 09:18:57,141 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:18:57,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:18:57,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:18:57,149 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:18:57,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:18:52" (1/3) ... [2025-03-04 09:18:57,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3cc574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:18:57, skipping insertion in model container [2025-03-04 09:18:57,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:18:53" (2/3) ... [2025-03-04 09:18:57,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3cc574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:18:57, skipping insertion in model container [2025-03-04 09:18:57,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:18:57" (3/3) ... [2025-03-04 09:18:57,151 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test10-1.i [2025-03-04 09:18:57,162 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:18:57,165 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test10-1.i that has 6 procedures, 2646 locations, 1 initial locations, 78 loop locations, and 986 error locations. [2025-03-04 09:18:57,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:18:57,234 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;@5ae47f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:18:57,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2025-03-04 09:18:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 2636 states, 1638 states have (on average 1.9786324786324787) internal successors, (3241), 2622 states have internal predecessors, (3241), 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-03-04 09:18:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:18:57,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:18:57,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:18:57,246 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-03-04 09:18:57,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:18:57,250 INFO L85 PathProgramCache]: Analyzing trace with hash 3394041, now seen corresponding path program 1 times [2025-03-04 09:18:57,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:18:57,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191181373] [2025-03-04 09:18:57,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:18:57,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:18:57,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:18:57,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:18:57,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:18:57,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:18:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:18:57,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:18:57,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191181373] [2025-03-04 09:18:57,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191181373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:18:57,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:18:57,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:18:57,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055479948] [2025-03-04 09:18:57,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:18:57,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:18:57,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:18:57,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:18:57,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:18:57,434 INFO L87 Difference]: Start difference. First operand has 2636 states, 1638 states have (on average 1.9786324786324787) internal successors, (3241), 2622 states have internal predecessors, (3241), 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-03-04 09:18:58,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:18:58,871 INFO L93 Difference]: Finished difference Result 3219 states and 3790 transitions. [2025-03-04 09:18:58,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:18:58,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:18:58,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:18:58,895 INFO L225 Difference]: With dead ends: 3219 [2025-03-04 09:18:58,895 INFO L226 Difference]: Without dead ends: 3217 [2025-03-04 09:18:58,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:18:58,902 INFO L435 NwaCegarLoop]: 2063 mSDtfsCounter, 2855 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2865 SdHoareTripleChecker+Valid, 2575 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:18:58,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2865 Valid, 2575 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 09:18:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2025-03-04 09:18:58,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 2871. [2025-03-04 09:18:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 1901 states have (on average 1.8742766964755393) internal successors, (3563), 2855 states have internal predecessors, (3563), 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-03-04 09:18:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 3595 transitions. [2025-03-04 09:18:59,015 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 3595 transitions. Word has length 3 [2025-03-04 09:18:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:18:59,016 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 3595 transitions. [2025-03-04 09:18:59,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:18:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 3595 transitions. [2025-03-04 09:18:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:18:59,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:18:59,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:18:59,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:18:59,017 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-03-04 09:18:59,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:18:59,017 INFO L85 PathProgramCache]: Analyzing trace with hash 3394042, now seen corresponding path program 1 times [2025-03-04 09:18:59,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:18:59,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75676997] [2025-03-04 09:18:59,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:18:59,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:18:59,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:18:59,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:18:59,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:18:59,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:18:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:18:59,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:18:59,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75676997] [2025-03-04 09:18:59,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75676997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:18:59,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:18:59,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:18:59,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305408749] [2025-03-04 09:18:59,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:18:59,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:18:59,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:18:59,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:18:59,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:18:59,111 INFO L87 Difference]: Start difference. First operand 2871 states and 3595 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:00,542 INFO L93 Difference]: Finished difference Result 4036 states and 5064 transitions. [2025-03-04 09:19:00,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:19:00,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:19:00,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:00,554 INFO L225 Difference]: With dead ends: 4036 [2025-03-04 09:19:00,554 INFO L226 Difference]: Without dead ends: 4036 [2025-03-04 09:19:00,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:19:00,555 INFO L435 NwaCegarLoop]: 2613 mSDtfsCounter, 1463 mSDsluCounter, 1978 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 4591 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.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:00,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 4591 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 09:19:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2025-03-04 09:19:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 3708. [2025-03-04 09:19:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3708 states, 2736 states have (on average 1.8369883040935673) internal successors, (5026), 3689 states have internal predecessors, (5026), 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-03-04 09:19:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 5064 transitions. [2025-03-04 09:19:00,619 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 5064 transitions. Word has length 3 [2025-03-04 09:19:00,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:00,619 INFO L471 AbstractCegarLoop]: Abstraction has 3708 states and 5064 transitions. [2025-03-04 09:19:00,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 5064 transitions. [2025-03-04 09:19:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 09:19:00,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:00,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:19:00,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:19:00,619 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-03-04 09:19:00,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:00,620 INFO L85 PathProgramCache]: Analyzing trace with hash -754862443, now seen corresponding path program 1 times [2025-03-04 09:19:00,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:00,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563708869] [2025-03-04 09:19:00,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:00,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:00,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 09:19:00,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 09:19:00,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:00,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:00,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:00,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563708869] [2025-03-04 09:19:00,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563708869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:00,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:00,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:19:00,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291159647] [2025-03-04 09:19:00,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:00,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:19:00,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:00,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:19:00,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:19:00,798 INFO L87 Difference]: Start difference. First operand 3708 states and 5064 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:04,542 INFO L93 Difference]: Finished difference Result 6952 states and 8532 transitions. [2025-03-04 09:19:04,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:19:04,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 09:19:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:04,558 INFO L225 Difference]: With dead ends: 6952 [2025-03-04 09:19:04,558 INFO L226 Difference]: Without dead ends: 6952 [2025-03-04 09:19:04,558 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-03-04 09:19:04,558 INFO L435 NwaCegarLoop]: 2423 mSDtfsCounter, 6139 mSDsluCounter, 5170 mSDsCounter, 0 mSdLazyCounter, 6213 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6142 SdHoareTripleChecker+Valid, 7593 SdHoareTripleChecker+Invalid, 6260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 6213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:04,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6142 Valid, 7593 Invalid, 6260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 6213 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-04 09:19:04,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6952 states. [2025-03-04 09:19:04,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6952 to 4715. [2025-03-04 09:19:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4715 states, 3743 states have (on average 1.8693561314453646) internal successors, (6997), 4690 states have internal predecessors, (6997), 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-03-04 09:19:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4715 states to 4715 states and 7047 transitions. [2025-03-04 09:19:04,624 INFO L78 Accepts]: Start accepts. Automaton has 4715 states and 7047 transitions. Word has length 7 [2025-03-04 09:19:04,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:04,624 INFO L471 AbstractCegarLoop]: Abstraction has 4715 states and 7047 transitions. [2025-03-04 09:19:04,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:04,625 INFO L276 IsEmpty]: Start isEmpty. Operand 4715 states and 7047 transitions. [2025-03-04 09:19:04,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 09:19:04,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:04,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:19:04,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:19:04,625 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-03-04 09:19:04,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:04,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1925895946, now seen corresponding path program 1 times [2025-03-04 09:19:04,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:04,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862308668] [2025-03-04 09:19:04,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:04,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:04,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:19:04,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:19:04,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:04,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:04,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-03-04 09:19:04,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:04,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862308668] [2025-03-04 09:19:04,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862308668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:04,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:04,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:19:04,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98076486] [2025-03-04 09:19:04,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:04,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:19:04,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:04,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:19:04,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:19:04,662 INFO L87 Difference]: Start difference. First operand 4715 states and 7047 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:05,746 INFO L93 Difference]: Finished difference Result 5791 states and 8305 transitions. [2025-03-04 09:19:05,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:19:05,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 09:19:05,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:05,759 INFO L225 Difference]: With dead ends: 5791 [2025-03-04 09:19:05,759 INFO L226 Difference]: Without dead ends: 5791 [2025-03-04 09:19:05,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:19:05,760 INFO L435 NwaCegarLoop]: 3310 mSDtfsCounter, 2826 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2836 SdHoareTripleChecker+Valid, 4395 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:05,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2836 Valid, 4395 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 09:19:05,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5791 states. [2025-03-04 09:19:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5791 to 4623. [2025-03-04 09:19:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4623 states, 3743 states have (on average 1.8119155757413838) internal successors, (6782), 4598 states have internal predecessors, (6782), 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-03-04 09:19:05,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4623 states to 4623 states and 6832 transitions. [2025-03-04 09:19:05,837 INFO L78 Accepts]: Start accepts. Automaton has 4623 states and 6832 transitions. Word has length 8 [2025-03-04 09:19:05,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:05,838 INFO L471 AbstractCegarLoop]: Abstraction has 4623 states and 6832 transitions. [2025-03-04 09:19:05,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:05,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4623 states and 6832 transitions. [2025-03-04 09:19:05,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 09:19:05,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:05,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:19:05,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:19:05,838 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-03-04 09:19:05,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:05,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1925895945, now seen corresponding path program 1 times [2025-03-04 09:19:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:05,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597384577] [2025-03-04 09:19:05,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:05,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:05,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:19:05,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:19:05,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:05,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:05,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:05,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:05,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597384577] [2025-03-04 09:19:05,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597384577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:05,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:05,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:19:05,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845357712] [2025-03-04 09:19:05,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:05,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:19:05,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:05,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:19:05,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:19:05,914 INFO L87 Difference]: Start difference. First operand 4623 states and 6832 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:07,078 INFO L93 Difference]: Finished difference Result 7346 states and 10773 transitions. [2025-03-04 09:19:07,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:19:07,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 09:19:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:07,096 INFO L225 Difference]: With dead ends: 7346 [2025-03-04 09:19:07,097 INFO L226 Difference]: Without dead ends: 7346 [2025-03-04 09:19:07,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:19:07,097 INFO L435 NwaCegarLoop]: 3667 mSDtfsCounter, 2307 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2311 SdHoareTripleChecker+Valid, 5331 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:07,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2311 Valid, 5331 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 09:19:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7346 states. [2025-03-04 09:19:07,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7346 to 5155. [2025-03-04 09:19:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 4285 states have (on average 1.8030338389731622) internal successors, (7726), 5130 states have internal predecessors, (7726), 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-03-04 09:19:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 7776 transitions. [2025-03-04 09:19:07,167 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 7776 transitions. Word has length 8 [2025-03-04 09:19:07,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:07,167 INFO L471 AbstractCegarLoop]: Abstraction has 5155 states and 7776 transitions. [2025-03-04 09:19:07,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 7776 transitions. [2025-03-04 09:19:07,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 09:19:07,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:07,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:19:07,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:19:07,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr346REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-04 09:19:07,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1294427171, now seen corresponding path program 1 times [2025-03-04 09:19:07,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:07,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178294652] [2025-03-04 09:19:07,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:07,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:07,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:19:07,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:19:07,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:07,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:07,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:07,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178294652] [2025-03-04 09:19:07,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178294652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:07,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:07,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:19:07,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040363063] [2025-03-04 09:19:07,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:07,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:19:07,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:07,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:19:07,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:19:07,254 INFO L87 Difference]: Start difference. First operand 5155 states and 7776 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:07,620 INFO L93 Difference]: Finished difference Result 7142 states and 10540 transitions. [2025-03-04 09:19:07,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:19:07,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 09:19:07,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:07,633 INFO L225 Difference]: With dead ends: 7142 [2025-03-04 09:19:07,633 INFO L226 Difference]: Without dead ends: 7142 [2025-03-04 09:19:07,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:19:07,634 INFO L435 NwaCegarLoop]: 3074 mSDtfsCounter, 1443 mSDsluCounter, 5788 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 8862 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:07,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 8862 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 09:19:07,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7142 states. [2025-03-04 09:19:07,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7142 to 5157. [2025-03-04 09:19:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5157 states, 4287 states have (on average 1.8026592022393282) internal successors, (7728), 5132 states have internal predecessors, (7728), 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-03-04 09:19:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5157 states to 5157 states and 7778 transitions. [2025-03-04 09:19:07,696 INFO L78 Accepts]: Start accepts. Automaton has 5157 states and 7778 transitions. Word has length 10 [2025-03-04 09:19:07,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:07,696 INFO L471 AbstractCegarLoop]: Abstraction has 5157 states and 7778 transitions. [2025-03-04 09:19:07,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 5157 states and 7778 transitions. [2025-03-04 09:19:07,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 09:19:07,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:07,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:19:07,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:19:07,697 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-03-04 09:19:07,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:07,697 INFO L85 PathProgramCache]: Analyzing trace with hash 180417095, now seen corresponding path program 1 times [2025-03-04 09:19:07,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:07,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025747656] [2025-03-04 09:19:07,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:07,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:07,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:19:07,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:19:07,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:07,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:07,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:07,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025747656] [2025-03-04 09:19:07,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025747656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:07,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:07,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:19:07,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296695706] [2025-03-04 09:19:07,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:07,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:19:07,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:07,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:19:07,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:19:07,747 INFO L87 Difference]: Start difference. First operand 5157 states and 7778 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:08,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:08,763 INFO L93 Difference]: Finished difference Result 5232 states and 7884 transitions. [2025-03-04 09:19:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:19:08,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 09:19:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:08,772 INFO L225 Difference]: With dead ends: 5232 [2025-03-04 09:19:08,772 INFO L226 Difference]: Without dead ends: 5232 [2025-03-04 09:19:08,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:19:08,773 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 3089 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3099 SdHoareTripleChecker+Valid, 3667 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:08,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3099 Valid, 3667 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2240 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 09:19:08,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5232 states. [2025-03-04 09:19:08,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5232 to 5134. [2025-03-04 09:19:08,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5134 states, 4287 states have (on average 1.7919290879402845) internal successors, (7682), 5109 states have internal predecessors, (7682), 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-03-04 09:19:08,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5134 states to 5134 states and 7732 transitions. [2025-03-04 09:19:08,838 INFO L78 Accepts]: Start accepts. Automaton has 5134 states and 7732 transitions. Word has length 19 [2025-03-04 09:19:08,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:08,838 INFO L471 AbstractCegarLoop]: Abstraction has 5134 states and 7732 transitions. [2025-03-04 09:19:08,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 5134 states and 7732 transitions. [2025-03-04 09:19:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 09:19:08,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:08,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:19:08,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:19:08,841 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-03-04 09:19:08,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:08,842 INFO L85 PathProgramCache]: Analyzing trace with hash 180417096, now seen corresponding path program 1 times [2025-03-04 09:19:08,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:08,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903283630] [2025-03-04 09:19:08,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:08,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:08,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:19:08,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:19:08,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:08,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:08,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:08,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:08,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903283630] [2025-03-04 09:19:08,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903283630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:08,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:08,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:19:08,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663689484] [2025-03-04 09:19:08,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:08,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:19:08,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:08,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:19:08,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:19:08,915 INFO L87 Difference]: Start difference. First operand 5134 states and 7732 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:09,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:09,078 INFO L93 Difference]: Finished difference Result 4996 states and 7526 transitions. [2025-03-04 09:19:09,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:19:09,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 09:19:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:09,089 INFO L225 Difference]: With dead ends: 4996 [2025-03-04 09:19:09,089 INFO L226 Difference]: Without dead ends: 4996 [2025-03-04 09:19:09,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:19:09,089 INFO L435 NwaCegarLoop]: 2732 mSDtfsCounter, 60 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 5411 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:09,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 5411 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:19:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4996 states. [2025-03-04 09:19:09,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4996 to 4996. [2025-03-04 09:19:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4996 states, 4161 states have (on average 1.7966834895457822) internal successors, (7476), 4971 states have internal predecessors, (7476), 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-03-04 09:19:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 7526 transitions. [2025-03-04 09:19:09,143 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 7526 transitions. Word has length 19 [2025-03-04 09:19:09,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:09,143 INFO L471 AbstractCegarLoop]: Abstraction has 4996 states and 7526 transitions. [2025-03-04 09:19:09,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:09,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 7526 transitions. [2025-03-04 09:19:09,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 09:19:09,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:09,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:19:09,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:19:09,145 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr659REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-04 09:19:09,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash 155882248, now seen corresponding path program 1 times [2025-03-04 09:19:09,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:09,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610013739] [2025-03-04 09:19:09,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:09,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:09,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:19:09,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:19:09,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:09,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:09,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:09,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610013739] [2025-03-04 09:19:09,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610013739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:09,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:09,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:19:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499220366] [2025-03-04 09:19:09,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:09,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:19:09,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:09,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:19:09,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:19:09,240 INFO L87 Difference]: Start difference. First operand 4996 states and 7526 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:09,551 INFO L93 Difference]: Finished difference Result 6883 states and 10161 transitions. [2025-03-04 09:19:09,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:19:09,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 09:19:09,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:09,562 INFO L225 Difference]: With dead ends: 6883 [2025-03-04 09:19:09,562 INFO L226 Difference]: Without dead ends: 6883 [2025-03-04 09:19:09,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:19:09,563 INFO L435 NwaCegarLoop]: 3011 mSDtfsCounter, 1306 mSDsluCounter, 5609 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 8620 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:09,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 8620 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 09:19:09,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6883 states. [2025-03-04 09:19:09,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6883 to 5006. [2025-03-04 09:19:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5006 states, 4171 states have (on average 1.794773435626948) internal successors, (7486), 4981 states have internal predecessors, (7486), 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-03-04 09:19:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5006 states to 5006 states and 7536 transitions. [2025-03-04 09:19:09,614 INFO L78 Accepts]: Start accepts. Automaton has 5006 states and 7536 transitions. Word has length 19 [2025-03-04 09:19:09,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:09,614 INFO L471 AbstractCegarLoop]: Abstraction has 5006 states and 7536 transitions. [2025-03-04 09:19:09,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:09,614 INFO L276 IsEmpty]: Start isEmpty. Operand 5006 states and 7536 transitions. [2025-03-04 09:19:09,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 09:19:09,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:09,614 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] [2025-03-04 09:19:09,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:19:09,615 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-03-04 09:19:09,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:09,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1297840874, now seen corresponding path program 1 times [2025-03-04 09:19:09,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:09,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376953961] [2025-03-04 09:19:09,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:09,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:09,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:19:09,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:19:09,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:09,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:09,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:09,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:09,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376953961] [2025-03-04 09:19:09,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376953961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:09,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:09,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:19:09,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775720390] [2025-03-04 09:19:09,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:09,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:19:09,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:09,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:19:09,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:19:09,678 INFO L87 Difference]: Start difference. First operand 5006 states and 7536 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:09,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:09,908 INFO L93 Difference]: Finished difference Result 4983 states and 7492 transitions. [2025-03-04 09:19:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:19:09,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 09:19:09,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:09,918 INFO L225 Difference]: With dead ends: 4983 [2025-03-04 09:19:09,918 INFO L226 Difference]: Without dead ends: 4983 [2025-03-04 09:19:09,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:19:09,919 INFO L435 NwaCegarLoop]: 2694 mSDtfsCounter, 45 mSDsluCounter, 5365 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8059 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-03-04 09:19:09,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8059 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:19:09,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4983 states. [2025-03-04 09:19:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4983 to 4983. [2025-03-04 09:19:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4983 states, 4155 states have (on average 1.7910950661853189) internal successors, (7442), 4958 states have internal predecessors, (7442), 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-03-04 09:19:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 7492 transitions. [2025-03-04 09:19:09,965 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 7492 transitions. Word has length 20 [2025-03-04 09:19:09,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:09,965 INFO L471 AbstractCegarLoop]: Abstraction has 4983 states and 7492 transitions. [2025-03-04 09:19:09,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 7492 transitions. [2025-03-04 09:19:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 09:19:09,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:09,966 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] [2025-03-04 09:19:09,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:19:09,966 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-03-04 09:19:09,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1662614112, now seen corresponding path program 1 times [2025-03-04 09:19:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:09,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858348985] [2025-03-04 09:19:09,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:09,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:09,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 09:19:09,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 09:19:09,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:09,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:10,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:10,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858348985] [2025-03-04 09:19:10,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858348985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:10,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:10,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:19:10,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928112922] [2025-03-04 09:19:10,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:10,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:19:10,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:10,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:19:10,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:19:10,072 INFO L87 Difference]: Start difference. First operand 4983 states and 7492 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:11,624 INFO L93 Difference]: Finished difference Result 7268 states and 10633 transitions. [2025-03-04 09:19:11,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:19:11,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-04 09:19:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:11,633 INFO L225 Difference]: With dead ends: 7268 [2025-03-04 09:19:11,634 INFO L226 Difference]: Without dead ends: 7268 [2025-03-04 09:19:11,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:19:11,634 INFO L435 NwaCegarLoop]: 2168 mSDtfsCounter, 2307 mSDsluCounter, 3411 mSDsCounter, 0 mSdLazyCounter, 2709 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2311 SdHoareTripleChecker+Valid, 5579 SdHoareTripleChecker+Invalid, 2712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:11,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2311 Valid, 5579 Invalid, 2712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2709 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 09:19:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7268 states. [2025-03-04 09:19:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7268 to 4979. [2025-03-04 09:19:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4979 states, 4155 states have (on average 1.7891696750902526) internal successors, (7434), 4954 states have internal predecessors, (7434), 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-03-04 09:19:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4979 states to 4979 states and 7484 transitions. [2025-03-04 09:19:11,683 INFO L78 Accepts]: Start accepts. Automaton has 4979 states and 7484 transitions. Word has length 34 [2025-03-04 09:19:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:11,683 INFO L471 AbstractCegarLoop]: Abstraction has 4979 states and 7484 transitions. [2025-03-04 09:19:11,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 4979 states and 7484 transitions. [2025-03-04 09:19:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 09:19:11,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:11,684 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] [2025-03-04 09:19:11,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:19:11,685 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-03-04 09:19:11,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1637404949, now seen corresponding path program 1 times [2025-03-04 09:19:11,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:11,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891125355] [2025-03-04 09:19:11,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:11,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 09:19:11,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 09:19:11,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:11,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:11,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:11,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891125355] [2025-03-04 09:19:11,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891125355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:11,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:11,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:19:11,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670474954] [2025-03-04 09:19:11,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:11,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:19:11,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:11,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:19:11,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:19:11,768 INFO L87 Difference]: Start difference. First operand 4979 states and 7484 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:11,978 INFO L93 Difference]: Finished difference Result 4967 states and 7464 transitions. [2025-03-04 09:19:11,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:19:11,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2025-03-04 09:19:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:11,986 INFO L225 Difference]: With dead ends: 4967 [2025-03-04 09:19:11,986 INFO L226 Difference]: Without dead ends: 4967 [2025-03-04 09:19:11,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:19:11,987 INFO L435 NwaCegarLoop]: 2692 mSDtfsCounter, 21 mSDsluCounter, 5353 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8045 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-03-04 09:19:11,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8045 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:19:11,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4967 states. [2025-03-04 09:19:12,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4967 to 4967. [2025-03-04 09:19:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4967 states, 4143 states have (on average 1.7895244991552015) internal successors, (7414), 4942 states have internal predecessors, (7414), 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-03-04 09:19:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4967 states to 4967 states and 7464 transitions. [2025-03-04 09:19:12,033 INFO L78 Accepts]: Start accepts. Automaton has 4967 states and 7464 transitions. Word has length 68 [2025-03-04 09:19:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:12,033 INFO L471 AbstractCegarLoop]: Abstraction has 4967 states and 7464 transitions. [2025-03-04 09:19:12,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 4967 states and 7464 transitions. [2025-03-04 09:19:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 09:19:12,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:12,037 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] [2025-03-04 09:19:12,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:19:12,038 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-03-04 09:19:12,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:12,038 INFO L85 PathProgramCache]: Analyzing trace with hash 652935901, now seen corresponding path program 1 times [2025-03-04 09:19:12,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:12,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452324752] [2025-03-04 09:19:12,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:12,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:12,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 09:19:12,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 09:19:12,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:12,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:12,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:12,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452324752] [2025-03-04 09:19:12,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452324752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:12,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:12,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:19:12,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330473741] [2025-03-04 09:19:12,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:12,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:19:12,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:12,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:19:12,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:19:12,165 INFO L87 Difference]: Start difference. First operand 4967 states and 7464 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:12,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:12,403 INFO L93 Difference]: Finished difference Result 6457 states and 9629 transitions. [2025-03-04 09:19:12,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:19:12,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2025-03-04 09:19:12,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:12,410 INFO L225 Difference]: With dead ends: 6457 [2025-03-04 09:19:12,411 INFO L226 Difference]: Without dead ends: 6457 [2025-03-04 09:19:12,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:19:12,411 INFO L435 NwaCegarLoop]: 2706 mSDtfsCounter, 1077 mSDsluCounter, 2644 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 5350 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:12,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 5350 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:19:12,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6457 states. [2025-03-04 09:19:12,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6457 to 5810. [2025-03-04 09:19:12,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5810 states, 4982 states have (on average 1.7707747892412686) internal successors, (8822), 5781 states have internal predecessors, (8822), 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-03-04 09:19:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5810 states to 5810 states and 8880 transitions. [2025-03-04 09:19:12,459 INFO L78 Accepts]: Start accepts. Automaton has 5810 states and 8880 transitions. Word has length 76 [2025-03-04 09:19:12,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:12,459 INFO L471 AbstractCegarLoop]: Abstraction has 5810 states and 8880 transitions. [2025-03-04 09:19:12,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 5810 states and 8880 transitions. [2025-03-04 09:19:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 09:19:12,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:12,460 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-03-04 09:19:12,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:19:12,460 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-03-04 09:19:12,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:12,461 INFO L85 PathProgramCache]: Analyzing trace with hash -292842370, now seen corresponding path program 1 times [2025-03-04 09:19:12,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:12,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209693884] [2025-03-04 09:19:12,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:12,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:12,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 09:19:12,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 09:19:12,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:12,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:12,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:12,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209693884] [2025-03-04 09:19:12,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209693884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:12,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:12,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:19:12,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503085929] [2025-03-04 09:19:12,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:12,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:19:12,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:12,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:19:12,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:19:12,837 INFO L87 Difference]: Start difference. First operand 5810 states and 8880 transitions. Second operand has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 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-03-04 09:19:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:14,284 INFO L93 Difference]: Finished difference Result 5726 states and 8681 transitions. [2025-03-04 09:19:14,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:19:14,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 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-03-04 09:19:14,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:14,292 INFO L225 Difference]: With dead ends: 5726 [2025-03-04 09:19:14,292 INFO L226 Difference]: Without dead ends: 5726 [2025-03-04 09:19:14,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:19:14,292 INFO L435 NwaCegarLoop]: 1424 mSDtfsCounter, 5238 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 2651 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5248 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 2759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:14,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5248 Valid, 2796 Invalid, 2759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2651 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 09:19:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2025-03-04 09:19:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 5184. [2025-03-04 09:19:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5184 states, 4440 states have (on average 1.725) internal successors, (7659), 5155 states have internal predecessors, (7659), 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-03-04 09:19:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 7717 transitions. [2025-03-04 09:19:14,340 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 7717 transitions. Word has length 79 [2025-03-04 09:19:14,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:14,340 INFO L471 AbstractCegarLoop]: Abstraction has 5184 states and 7717 transitions. [2025-03-04 09:19:14,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 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-03-04 09:19:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 7717 transitions. [2025-03-04 09:19:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 09:19:14,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:14,341 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] [2025-03-04 09:19:14,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:19:14,341 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-03-04 09:19:14,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2060811752, now seen corresponding path program 1 times [2025-03-04 09:19:14,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:14,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072276870] [2025-03-04 09:19:14,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:14,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:14,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 09:19:14,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 09:19:14,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:14,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:14,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:14,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072276870] [2025-03-04 09:19:14,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072276870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:14,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:14,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:19:14,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092051285] [2025-03-04 09:19:14,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:14,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:19:14,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:14,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:19:14,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:19:14,513 INFO L87 Difference]: Start difference. First operand 5184 states and 7717 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:15,678 INFO L93 Difference]: Finished difference Result 5183 states and 7715 transitions. [2025-03-04 09:19:15,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:19:15,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2025-03-04 09:19:15,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:15,683 INFO L225 Difference]: With dead ends: 5183 [2025-03-04 09:19:15,683 INFO L226 Difference]: Without dead ends: 5183 [2025-03-04 09:19:15,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:19:15,684 INFO L435 NwaCegarLoop]: 2618 mSDtfsCounter, 2 mSDsluCounter, 5369 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7987 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:15,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7987 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2936 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 09:19:15,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5183 states. [2025-03-04 09:19:15,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5183 to 5183. [2025-03-04 09:19:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5183 states, 4440 states have (on average 1.7245495495495495) internal successors, (7657), 5154 states have internal predecessors, (7657), 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-03-04 09:19:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5183 states to 5183 states and 7715 transitions. [2025-03-04 09:19:15,726 INFO L78 Accepts]: Start accepts. Automaton has 5183 states and 7715 transitions. Word has length 84 [2025-03-04 09:19:15,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:15,726 INFO L471 AbstractCegarLoop]: Abstraction has 5183 states and 7715 transitions. [2025-03-04 09:19:15,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 5183 states and 7715 transitions. [2025-03-04 09:19:15,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 09:19:15,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:15,727 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] [2025-03-04 09:19:15,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:19:15,727 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-03-04 09:19:15,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:15,727 INFO L85 PathProgramCache]: Analyzing trace with hash 2060811753, now seen corresponding path program 1 times [2025-03-04 09:19:15,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:15,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081365116] [2025-03-04 09:19:15,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:15,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:15,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 09:19:15,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 09:19:15,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:15,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:16,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:16,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:16,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081365116] [2025-03-04 09:19:16,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081365116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:16,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:16,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:19:16,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928236877] [2025-03-04 09:19:16,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:16,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:19:16,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:16,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:19:16,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:19:16,042 INFO L87 Difference]: Start difference. First operand 5183 states and 7715 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:17,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:17,461 INFO L93 Difference]: Finished difference Result 5182 states and 7713 transitions. [2025-03-04 09:19:17,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:19:17,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2025-03-04 09:19:17,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:17,467 INFO L225 Difference]: With dead ends: 5182 [2025-03-04 09:19:17,467 INFO L226 Difference]: Without dead ends: 5182 [2025-03-04 09:19:17,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:19:17,467 INFO L435 NwaCegarLoop]: 2618 mSDtfsCounter, 1 mSDsluCounter, 5343 mSDsCounter, 0 mSdLazyCounter, 2959 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 7961 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.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:17,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 7961 Invalid, 2960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2959 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 09:19:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5182 states. [2025-03-04 09:19:17,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5182 to 5182. [2025-03-04 09:19:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5182 states, 4438 states have (on average 1.724876070301938) internal successors, (7655), 5153 states have internal predecessors, (7655), 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-03-04 09:19:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5182 states to 5182 states and 7713 transitions. [2025-03-04 09:19:17,511 INFO L78 Accepts]: Start accepts. Automaton has 5182 states and 7713 transitions. Word has length 84 [2025-03-04 09:19:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:17,511 INFO L471 AbstractCegarLoop]: Abstraction has 5182 states and 7713 transitions. [2025-03-04 09:19:17,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:19:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 5182 states and 7713 transitions. [2025-03-04 09:19:17,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 09:19:17,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:17,512 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] [2025-03-04 09:19:17,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:19:17,512 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-03-04 09:19:17,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:17,512 INFO L85 PathProgramCache]: Analyzing trace with hash -138486331, now seen corresponding path program 1 times [2025-03-04 09:19:17,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:17,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815827301] [2025-03-04 09:19:17,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:17,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:17,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 09:19:17,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 09:19:17,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:17,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:17,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-03-04 09:19:17,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:17,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815827301] [2025-03-04 09:19:17,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815827301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:17,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:17,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:19:17,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362791458] [2025-03-04 09:19:17,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:17,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:19:17,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:17,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:19:17,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:19:17,681 INFO L87 Difference]: Start difference. First operand 5182 states and 7713 transitions. Second operand has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:19:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:19,464 INFO L93 Difference]: Finished difference Result 5200 states and 7748 transitions. [2025-03-04 09:19:19,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:19:19,464 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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 92 [2025-03-04 09:19:19,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:19,471 INFO L225 Difference]: With dead ends: 5200 [2025-03-04 09:19:19,471 INFO L226 Difference]: Without dead ends: 5200 [2025-03-04 09:19:19,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:19:19,472 INFO L435 NwaCegarLoop]: 2582 mSDtfsCounter, 27 mSDsluCounter, 9916 mSDsCounter, 0 mSdLazyCounter, 3854 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12498 SdHoareTripleChecker+Invalid, 3865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:19,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 12498 Invalid, 3865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3854 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 09:19:19,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2025-03-04 09:19:19,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 5191. [2025-03-04 09:19:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5191 states, 4446 states have (on average 1.7242465137201979) internal successors, (7666), 5160 states have internal predecessors, (7666), 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-03-04 09:19:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 7738 transitions. [2025-03-04 09:19:19,518 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 7738 transitions. Word has length 92 [2025-03-04 09:19:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:19,518 INFO L471 AbstractCegarLoop]: Abstraction has 5191 states and 7738 transitions. [2025-03-04 09:19:19,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:19:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 7738 transitions. [2025-03-04 09:19:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 09:19:19,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:19,519 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] [2025-03-04 09:19:19,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:19:19,519 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-03-04 09:19:19,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:19,520 INFO L85 PathProgramCache]: Analyzing trace with hash -138486330, now seen corresponding path program 1 times [2025-03-04 09:19:19,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:19,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138201637] [2025-03-04 09:19:19,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:19,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:19,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 09:19:19,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 09:19:19,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:19,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:19,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:19,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138201637] [2025-03-04 09:19:19,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138201637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:19,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:19,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:19:19,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170847442] [2025-03-04 09:19:19,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:19,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:19:19,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:19,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:19:19,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:19:19,827 INFO L87 Difference]: Start difference. First operand 5191 states and 7738 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:19:21,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:21,350 INFO L93 Difference]: Finished difference Result 5191 states and 7736 transitions. [2025-03-04 09:19:21,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:19:21,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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 92 [2025-03-04 09:19:21,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:21,365 INFO L225 Difference]: With dead ends: 5191 [2025-03-04 09:19:21,365 INFO L226 Difference]: Without dead ends: 5191 [2025-03-04 09:19:21,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:19:21,366 INFO L435 NwaCegarLoop]: 2589 mSDtfsCounter, 22 mSDsluCounter, 7581 mSDsCounter, 0 mSdLazyCounter, 3447 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10170 SdHoareTripleChecker+Invalid, 3456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:21,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10170 Invalid, 3456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3447 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 09:19:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5191 states. [2025-03-04 09:19:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5191 to 5191. [2025-03-04 09:19:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5191 states, 4446 states have (on average 1.7237966711650923) internal successors, (7664), 5160 states have internal predecessors, (7664), 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-03-04 09:19:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 7736 transitions. [2025-03-04 09:19:21,406 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 7736 transitions. Word has length 92 [2025-03-04 09:19:21,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:21,407 INFO L471 AbstractCegarLoop]: Abstraction has 5191 states and 7736 transitions. [2025-03-04 09:19:21,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:19:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 7736 transitions. [2025-03-04 09:19:21,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 09:19:21,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:21,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:19:21,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:19:21,408 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-03-04 09:19:21,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:21,409 INFO L85 PathProgramCache]: Analyzing trace with hash 199797386, now seen corresponding path program 1 times [2025-03-04 09:19:21,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:21,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022867957] [2025-03-04 09:19:21,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:21,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:21,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 09:19:21,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 09:19:21,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:21,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:21,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:21,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022867957] [2025-03-04 09:19:21,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022867957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:19:21,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817625771] [2025-03-04 09:19:21,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:21,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:19:21,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:19:21,721 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:19:21,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:19:21,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 09:19:21,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 09:19:21,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:21,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:21,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 09:19:21,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:19:22,057 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:19:22,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:19:22,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:19:22,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:19:22,314 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:19:22,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:19:22,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:19:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:22,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:19:22,399 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_670 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-04 09:19:22,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817625771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:19:22,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:19:22,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2025-03-04 09:19:22,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587992045] [2025-03-04 09:19:22,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:19:22,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 09:19:22,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:22,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 09:19:22,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-03-04 09:19:22,402 INFO L87 Difference]: Start difference. First operand 5191 states and 7736 transitions. Second operand has 19 states, 16 states have (on average 7.375) internal successors, (118), 18 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:19:25,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:25,887 INFO L93 Difference]: Finished difference Result 5198 states and 7742 transitions. [2025-03-04 09:19:25,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:19:25,888 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.375) internal successors, (118), 18 states have internal predecessors, (118), 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 93 [2025-03-04 09:19:25,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:25,893 INFO L225 Difference]: With dead ends: 5198 [2025-03-04 09:19:25,893 INFO L226 Difference]: Without dead ends: 5198 [2025-03-04 09:19:25,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2025-03-04 09:19:25,894 INFO L435 NwaCegarLoop]: 1766 mSDtfsCounter, 2649 mSDsluCounter, 15666 mSDsCounter, 0 mSdLazyCounter, 9862 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2667 SdHoareTripleChecker+Valid, 17432 SdHoareTripleChecker+Invalid, 9889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 9862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:25,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2667 Valid, 17432 Invalid, 9889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 9862 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-04 09:19:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5198 states. [2025-03-04 09:19:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5198 to 5195. [2025-03-04 09:19:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5195 states, 4450 states have (on average 1.7229213483146066) internal successors, (7667), 5163 states have internal predecessors, (7667), 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-03-04 09:19:25,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5195 states to 5195 states and 7727 transitions. [2025-03-04 09:19:25,934 INFO L78 Accepts]: Start accepts. Automaton has 5195 states and 7727 transitions. Word has length 93 [2025-03-04 09:19:25,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:25,934 INFO L471 AbstractCegarLoop]: Abstraction has 5195 states and 7727 transitions. [2025-03-04 09:19:25,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.375) internal successors, (118), 18 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:19:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 5195 states and 7727 transitions. [2025-03-04 09:19:25,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 09:19:25,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:25,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:19:25,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 09:19:26,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:19:26,137 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-03-04 09:19:26,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:26,137 INFO L85 PathProgramCache]: Analyzing trace with hash 199797387, now seen corresponding path program 1 times [2025-03-04 09:19:26,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:26,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045200798] [2025-03-04 09:19:26,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:26,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 09:19:26,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 09:19:26,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:26,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:26,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:26,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045200798] [2025-03-04 09:19:26,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045200798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:19:26,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812373473] [2025-03-04 09:19:26,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:26,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:19:26,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:19:26,659 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:19:26,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:19:26,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 09:19:26,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 09:19:26,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:26,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:26,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 09:19:26,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:19:26,944 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:19:26,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:19:26,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 09:19:26,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 09:19:26,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:19:27,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:19:27,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:19:27,186 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:19:27,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:19:27,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:19:27,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:19:27,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:19:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:27,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:19:27,272 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_813 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-04 09:19:27,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812373473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:19:27,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:19:27,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2025-03-04 09:19:27,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340297533] [2025-03-04 09:19:27,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:19:27,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:19:27,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:27,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:19:27,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-03-04 09:19:27,275 INFO L87 Difference]: Start difference. First operand 5195 states and 7727 transitions. Second operand has 15 states, 12 states have (on average 9.333333333333334) internal successors, (112), 15 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:19:31,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:31,173 INFO L93 Difference]: Finished difference Result 5197 states and 7740 transitions. [2025-03-04 09:19:31,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:19:31,174 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.333333333333334) internal successors, (112), 15 states have internal predecessors, (112), 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 93 [2025-03-04 09:19:31,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:31,179 INFO L225 Difference]: With dead ends: 5197 [2025-03-04 09:19:31,179 INFO L226 Difference]: Without dead ends: 5197 [2025-03-04 09:19:31,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-03-04 09:19:31,180 INFO L435 NwaCegarLoop]: 1772 mSDtfsCounter, 2644 mSDsluCounter, 12469 mSDsCounter, 0 mSdLazyCounter, 10260 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2662 SdHoareTripleChecker+Valid, 14241 SdHoareTripleChecker+Invalid, 10287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 10260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:31,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2662 Valid, 14241 Invalid, 10287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 10260 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-04 09:19:31,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2025-03-04 09:19:31,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 5185. [2025-03-04 09:19:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5185 states, 4442 states have (on average 1.7235479513732552) internal successors, (7656), 5155 states have internal predecessors, (7656), 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-03-04 09:19:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 7714 transitions. [2025-03-04 09:19:31,217 INFO L78 Accepts]: Start accepts. Automaton has 5185 states and 7714 transitions. Word has length 93 [2025-03-04 09:19:31,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:31,217 INFO L471 AbstractCegarLoop]: Abstraction has 5185 states and 7714 transitions. [2025-03-04 09:19:31,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.333333333333334) internal successors, (112), 15 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:19:31,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5185 states and 7714 transitions. [2025-03-04 09:19:31,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 09:19:31,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:31,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] [2025-03-04 09:19:31,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 09:19:31,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-04 09:19:31,419 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr871REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-04 09:19:31,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:31,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1820198991, now seen corresponding path program 1 times [2025-03-04 09:19:31,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:31,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097744894] [2025-03-04 09:19:31,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:31,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:31,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 09:19:31,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 09:19:31,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:31,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:31,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:31,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097744894] [2025-03-04 09:19:31,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097744894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:31,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:31,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 09:19:31,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474948843] [2025-03-04 09:19:31,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:31,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:19:31,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:31,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:19:31,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:19:31,751 INFO L87 Difference]: Start difference. First operand 5185 states and 7714 transitions. Second operand has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 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-03-04 09:19:35,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:35,040 INFO L93 Difference]: Finished difference Result 5204 states and 7748 transitions. [2025-03-04 09:19:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:19:35,040 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 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-03-04 09:19:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:35,046 INFO L225 Difference]: With dead ends: 5204 [2025-03-04 09:19:35,046 INFO L226 Difference]: Without dead ends: 5204 [2025-03-04 09:19:35,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-03-04 09:19:35,047 INFO L435 NwaCegarLoop]: 1766 mSDtfsCounter, 2649 mSDsluCounter, 17412 mSDsCounter, 0 mSdLazyCounter, 10831 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2667 SdHoareTripleChecker+Valid, 19178 SdHoareTripleChecker+Invalid, 10854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 10831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:35,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2667 Valid, 19178 Invalid, 10854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 10831 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-04 09:19:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2025-03-04 09:19:35,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 5200. [2025-03-04 09:19:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5200 states, 4456 states have (on average 1.7219479353680431) internal successors, (7673), 5168 states have internal predecessors, (7673), 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-03-04 09:19:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 7733 transitions. [2025-03-04 09:19:35,118 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 7733 transitions. Word has length 95 [2025-03-04 09:19:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:35,118 INFO L471 AbstractCegarLoop]: Abstraction has 5200 states and 7733 transitions. [2025-03-04 09:19:35,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 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-03-04 09:19:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 7733 transitions. [2025-03-04 09:19:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 09:19:35,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:35,119 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-03-04 09:19:35,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 09:19:35,119 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr872REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-04 09:19:35,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:35,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1820198992, now seen corresponding path program 1 times [2025-03-04 09:19:35,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:35,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004711316] [2025-03-04 09:19:35,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:35,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:35,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 09:19:35,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 09:19:35,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:35,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:35,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:35,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004711316] [2025-03-04 09:19:35,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004711316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:35,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:35,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 09:19:35,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553364150] [2025-03-04 09:19:35,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:35,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:19:35,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:35,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:19:35,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:19:35,544 INFO L87 Difference]: Start difference. First operand 5200 states and 7733 transitions. Second operand has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 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-03-04 09:19:38,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:38,260 INFO L93 Difference]: Finished difference Result 5203 states and 7746 transitions. [2025-03-04 09:19:38,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:19:38,261 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 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-03-04 09:19:38,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:38,266 INFO L225 Difference]: With dead ends: 5203 [2025-03-04 09:19:38,266 INFO L226 Difference]: Without dead ends: 5203 [2025-03-04 09:19:38,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:19:38,268 INFO L435 NwaCegarLoop]: 1773 mSDtfsCounter, 2648 mSDsluCounter, 9351 mSDsCounter, 0 mSdLazyCounter, 7959 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2666 SdHoareTripleChecker+Valid, 11124 SdHoareTripleChecker+Invalid, 7981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:38,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2666 Valid, 11124 Invalid, 7981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7959 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-04 09:19:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5203 states. [2025-03-04 09:19:38,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5203 to 5200. [2025-03-04 09:19:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5200 states, 4456 states have (on average 1.7214991023339319) internal successors, (7671), 5168 states have internal predecessors, (7671), 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-03-04 09:19:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 7731 transitions. [2025-03-04 09:19:38,310 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 7731 transitions. Word has length 95 [2025-03-04 09:19:38,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:38,311 INFO L471 AbstractCegarLoop]: Abstraction has 5200 states and 7731 transitions. [2025-03-04 09:19:38,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 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-03-04 09:19:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 7731 transitions. [2025-03-04 09:19:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 09:19:38,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:38,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:19:38,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 09:19:38,312 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr871REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-04 09:19:38,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:38,312 INFO L85 PathProgramCache]: Analyzing trace with hash -657831574, now seen corresponding path program 1 times [2025-03-04 09:19:38,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:38,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916389183] [2025-03-04 09:19:38,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:38,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:38,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 09:19:38,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 09:19:38,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:38,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:38,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:38,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916389183] [2025-03-04 09:19:38,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916389183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:19:38,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129832491] [2025-03-04 09:19:38,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:38,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:19:38,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:19:38,675 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:19:38,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:19:38,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 09:19:38,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 09:19:38,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:38,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:38,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 09:19:38,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:19:38,967 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:19:38,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:19:38,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:19:39,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:19:39,134 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:19:39,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:19:39,192 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:19:39,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:19:39,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:19:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:39,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:19:39,296 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1093 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1096))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1093)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:19:39,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129832491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:19:39,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:19:39,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2025-03-04 09:19:39,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118938974] [2025-03-04 09:19:39,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:19:39,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 09:19:39,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:39,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 09:19:39,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=458, Unknown=16, NotChecked=44, Total=600 [2025-03-04 09:19:39,299 INFO L87 Difference]: Start difference. First operand 5200 states and 7731 transitions. Second operand has 22 states, 19 states have (on average 6.526315789473684) internal successors, (124), 21 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:19:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:43,424 INFO L93 Difference]: Finished difference Result 5202 states and 7744 transitions. [2025-03-04 09:19:43,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:19:43,424 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.526315789473684) internal successors, (124), 21 states have internal predecessors, (124), 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-03-04 09:19:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:43,430 INFO L225 Difference]: With dead ends: 5202 [2025-03-04 09:19:43,430 INFO L226 Difference]: Without dead ends: 5202 [2025-03-04 09:19:43,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=586, Unknown=16, NotChecked=50, Total=756 [2025-03-04 09:19:43,430 INFO L435 NwaCegarLoop]: 1765 mSDtfsCounter, 2636 mSDsluCounter, 19141 mSDsCounter, 0 mSdLazyCounter, 11805 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2654 SdHoareTripleChecker+Valid, 20906 SdHoareTripleChecker+Invalid, 11831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 11805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:43,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2654 Valid, 20906 Invalid, 11831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 11805 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-04 09:19:43,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5202 states. [2025-03-04 09:19:43,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5202 to 5199. [2025-03-04 09:19:43,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5199 states, 4456 states have (on average 1.7210502692998204) internal successors, (7669), 5167 states have internal predecessors, (7669), 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-03-04 09:19:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5199 states to 5199 states and 7729 transitions. [2025-03-04 09:19:43,469 INFO L78 Accepts]: Start accepts. Automaton has 5199 states and 7729 transitions. Word has length 96 [2025-03-04 09:19:43,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:43,469 INFO L471 AbstractCegarLoop]: Abstraction has 5199 states and 7729 transitions. [2025-03-04 09:19:43,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.526315789473684) internal successors, (124), 21 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:19:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 5199 states and 7729 transitions. [2025-03-04 09:19:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 09:19:43,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:43,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:19:43,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 09:19:43,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:19:43,671 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr872REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-04 09:19:43,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash -657831573, now seen corresponding path program 1 times [2025-03-04 09:19:43,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:43,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161707051] [2025-03-04 09:19:43,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:43,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 09:19:43,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 09:19:43,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:43,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:44,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:44,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161707051] [2025-03-04 09:19:44,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161707051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:19:44,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125546916] [2025-03-04 09:19:44,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:44,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:19:44,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:19:44,149 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:19:44,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:19:44,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 09:19:44,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 09:19:44,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:44,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:44,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 09:19:44,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:19:44,438 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:19:44,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:19:44,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 09:19:44,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:19:44,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 09:19:44,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:19:44,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:19:44,569 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:19:44,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:19:44,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:19:44,615 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:19:44,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:19:44,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:19:44,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:19:44,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 09:19:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:44,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:19:44,670 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1246 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1246 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1247) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-04 09:19:44,676 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1246 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1247) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1246 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-04 09:19:44,710 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1252))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1253) .cse0 v_ArrVal_1246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1247) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1253) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2025-03-04 09:19:44,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125546916] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:19:44,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:19:44,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 16 [2025-03-04 09:19:44,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369480340] [2025-03-04 09:19:44,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:19:44,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 09:19:44,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:44,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 09:19:44,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=286, Unknown=3, NotChecked=108, Total=462 [2025-03-04 09:19:44,713 INFO L87 Difference]: Start difference. First operand 5199 states and 7729 transitions. Second operand has 17 states, 14 states have (on average 8.357142857142858) internal successors, (117), 17 states have internal predecessors, (117), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:19:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:49,264 INFO L93 Difference]: Finished difference Result 5201 states and 7742 transitions. [2025-03-04 09:19:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:19:49,264 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.357142857142858) internal successors, (117), 17 states have internal predecessors, (117), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2025-03-04 09:19:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:49,269 INFO L225 Difference]: With dead ends: 5201 [2025-03-04 09:19:49,269 INFO L226 Difference]: Without dead ends: 5201 [2025-03-04 09:19:49,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=459, Unknown=3, NotChecked=138, Total=702 [2025-03-04 09:19:49,270 INFO L435 NwaCegarLoop]: 1771 mSDtfsCounter, 2661 mSDsluCounter, 13508 mSDsCounter, 0 mSdLazyCounter, 11957 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2679 SdHoareTripleChecker+Valid, 15279 SdHoareTripleChecker+Invalid, 11982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 11957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:49,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2679 Valid, 15279 Invalid, 11982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 11957 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-04 09:19:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2025-03-04 09:19:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 5183. [2025-03-04 09:19:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5183 states, 4442 states have (on average 1.7226474561008556) internal successors, (7652), 5153 states have internal predecessors, (7652), 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-03-04 09:19:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5183 states to 5183 states and 7710 transitions. [2025-03-04 09:19:49,308 INFO L78 Accepts]: Start accepts. Automaton has 5183 states and 7710 transitions. Word has length 96 [2025-03-04 09:19:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:49,308 INFO L471 AbstractCegarLoop]: Abstraction has 5183 states and 7710 transitions. [2025-03-04 09:19:49,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.357142857142858) internal successors, (117), 17 states have internal predecessors, (117), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:19:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 5183 states and 7710 transitions. [2025-03-04 09:19:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 09:19:49,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:49,309 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-03-04 09:19:49,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 09:19:49,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:19:49,509 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr867REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-04 09:19:49,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:49,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1588936286, now seen corresponding path program 1 times [2025-03-04 09:19:49,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:49,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522274195] [2025-03-04 09:19:49,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:49,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:49,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 09:19:49,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 09:19:49,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:49,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:49,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:49,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522274195] [2025-03-04 09:19:49,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522274195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:49,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:49,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 09:19:49,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008582949] [2025-03-04 09:19:49,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:49,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 09:19:49,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:49,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 09:19:49,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:19:49,795 INFO L87 Difference]: Start difference. First operand 5183 states and 7710 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 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-03-04 09:19:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:52,265 INFO L93 Difference]: Finished difference Result 5208 states and 7750 transitions. [2025-03-04 09:19:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:19:52,266 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 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-03-04 09:19:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:52,271 INFO L225 Difference]: With dead ends: 5208 [2025-03-04 09:19:52,271 INFO L226 Difference]: Without dead ends: 5208 [2025-03-04 09:19:52,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-04 09:19:52,271 INFO L435 NwaCegarLoop]: 1771 mSDtfsCounter, 2651 mSDsluCounter, 12195 mSDsCounter, 0 mSdLazyCounter, 7851 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2669 SdHoareTripleChecker+Valid, 13966 SdHoareTripleChecker+Invalid, 7873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:52,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2669 Valid, 13966 Invalid, 7873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7851 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-04 09:19:52,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5208 states. [2025-03-04 09:19:52,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5208 to 5204. [2025-03-04 09:19:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5204 states, 4462 states have (on average 1.72008068130883) internal successors, (7675), 5172 states have internal predecessors, (7675), 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-03-04 09:19:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5204 states to 5204 states and 7735 transitions. [2025-03-04 09:19:52,307 INFO L78 Accepts]: Start accepts. Automaton has 5204 states and 7735 transitions. Word has length 98 [2025-03-04 09:19:52,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:52,307 INFO L471 AbstractCegarLoop]: Abstraction has 5204 states and 7735 transitions. [2025-03-04 09:19:52,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 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-03-04 09:19:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 5204 states and 7735 transitions. [2025-03-04 09:19:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 09:19:52,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:52,308 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-03-04 09:19:52,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 09:19:52,308 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr868REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-04 09:19:52,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:52,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1588936287, now seen corresponding path program 1 times [2025-03-04 09:19:52,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:52,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141288176] [2025-03-04 09:19:52,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:52,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:52,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 09:19:52,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 09:19:52,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:52,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:52,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:52,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141288176] [2025-03-04 09:19:52,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141288176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:19:52,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:19:52,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 09:19:52,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452377302] [2025-03-04 09:19:52,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:19:52,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 09:19:52,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:52,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 09:19:52,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:19:52,789 INFO L87 Difference]: Start difference. First operand 5204 states and 7735 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 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-03-04 09:19:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:19:55,730 INFO L93 Difference]: Finished difference Result 5207 states and 7748 transitions. [2025-03-04 09:19:55,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:19:55,731 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 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-03-04 09:19:55,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:19:55,735 INFO L225 Difference]: With dead ends: 5207 [2025-03-04 09:19:55,735 INFO L226 Difference]: Without dead ends: 5207 [2025-03-04 09:19:55,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-04 09:19:55,736 INFO L435 NwaCegarLoop]: 1772 mSDtfsCounter, 2664 mSDsluCounter, 9016 mSDsCounter, 0 mSdLazyCounter, 8321 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 10788 SdHoareTripleChecker+Invalid, 8343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 8321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:19:55,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2682 Valid, 10788 Invalid, 8343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 8321 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-04 09:19:55,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5207 states. [2025-03-04 09:19:55,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5207 to 5204. [2025-03-04 09:19:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5204 states, 4462 states have (on average 1.7196324518153294) internal successors, (7673), 5172 states have internal predecessors, (7673), 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-03-04 09:19:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5204 states to 5204 states and 7733 transitions. [2025-03-04 09:19:55,773 INFO L78 Accepts]: Start accepts. Automaton has 5204 states and 7733 transitions. Word has length 98 [2025-03-04 09:19:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:19:55,773 INFO L471 AbstractCegarLoop]: Abstraction has 5204 states and 7733 transitions. [2025-03-04 09:19:55,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 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-03-04 09:19:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 5204 states and 7733 transitions. [2025-03-04 09:19:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 09:19:55,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:19:55,773 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-03-04 09:19:55,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 09:19:55,774 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr867REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-04 09:19:55,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:19:55,774 INFO L85 PathProgramCache]: Analyzing trace with hash 478258019, now seen corresponding path program 1 times [2025-03-04 09:19:55,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:19:55,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130966035] [2025-03-04 09:19:55,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:55,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:19:55,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 09:19:55,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 09:19:55,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:55,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:56,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:19:56,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130966035] [2025-03-04 09:19:56,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130966035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:19:56,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69261221] [2025-03-04 09:19:56,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:19:56,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:19:56,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:19:56,124 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:19:56,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:19:56,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 09:19:56,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 09:19:56,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:19:56,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:19:56,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 09:19:56,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:19:56,409 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:19:56,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:19:56,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:19:56,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 09:19:56,557 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:19:56,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:19:56,619 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:19:56,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:19:56,660 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:19:56,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:19:56,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-04 09:19:56,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:19:56,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:19:56,728 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1558 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1558) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-04 09:19:56,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69261221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:19:56,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:19:56,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2025-03-04 09:19:56,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048867403] [2025-03-04 09:19:56,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:19:56,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 09:19:56,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:19:56,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 09:19:56,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=58, NotChecked=52, Total=812 [2025-03-04 09:19:56,853 INFO L87 Difference]: Start difference. First operand 5204 states and 7733 transitions. Second operand has 24 states, 21 states have (on average 6.190476190476191) internal successors, (130), 23 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:20:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:20:01,820 INFO L93 Difference]: Finished difference Result 5206 states and 7746 transitions. [2025-03-04 09:20:01,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:20:01,820 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.190476190476191) internal successors, (130), 23 states have internal predecessors, (130), 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-03-04 09:20:01,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:20:01,825 INFO L225 Difference]: With dead ends: 5206 [2025-03-04 09:20:01,825 INFO L226 Difference]: Without dead ends: 5206 [2025-03-04 09:20:01,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=746, Unknown=62, NotChecked=58, Total=992 [2025-03-04 09:20:01,826 INFO L435 NwaCegarLoop]: 1764 mSDtfsCounter, 2654 mSDsluCounter, 22644 mSDsCounter, 0 mSdLazyCounter, 13751 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2672 SdHoareTripleChecker+Valid, 24408 SdHoareTripleChecker+Invalid, 13777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 13751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:20:01,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2672 Valid, 24408 Invalid, 13777 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 13751 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-04 09:20:01,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5206 states. [2025-03-04 09:20:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5206 to 5203. [2025-03-04 09:20:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5203 states, 4462 states have (on average 1.7191842223218288) internal successors, (7671), 5171 states have internal predecessors, (7671), 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-03-04 09:20:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5203 states to 5203 states and 7731 transitions. [2025-03-04 09:20:01,863 INFO L78 Accepts]: Start accepts. Automaton has 5203 states and 7731 transitions. Word has length 99 [2025-03-04 09:20:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:20:01,863 INFO L471 AbstractCegarLoop]: Abstraction has 5203 states and 7731 transitions. [2025-03-04 09:20:01,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.190476190476191) internal successors, (130), 23 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:20:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 5203 states and 7731 transitions. [2025-03-04 09:20:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 09:20:01,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:20:01,864 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-03-04 09:20:01,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:20:02,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 09:20:02,065 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr868REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-04 09:20:02,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:20:02,065 INFO L85 PathProgramCache]: Analyzing trace with hash 478258020, now seen corresponding path program 1 times [2025-03-04 09:20:02,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:20:02,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656724940] [2025-03-04 09:20:02,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:20:02,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:20:02,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 09:20:02,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 09:20:02,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:20:02,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:20:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:20:02,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:20:02,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656724940] [2025-03-04 09:20:02,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656724940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:20:02,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442336512] [2025-03-04 09:20:02,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:20:02,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:20:02,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:20:02,611 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:20:02,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:20:02,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 09:20:02,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 09:20:02,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:20:02,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:20:02,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 09:20:02,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:20:02,879 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:20:02,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:20:02,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 09:20:02,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:20:02,949 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:20:02,949 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 31 treesize of output 32 [2025-03-04 09:20:02,976 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:20:02,976 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 70 treesize of output 65 [2025-03-04 09:20:02,979 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 40 treesize of output 23 [2025-03-04 09:20:03,037 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:20:03,037 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 70 treesize of output 65 [2025-03-04 09:20:03,040 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 51 treesize of output 32 [2025-03-04 09:20:03,064 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 39 treesize of output 21 [2025-03-04 09:20:03,066 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 34 treesize of output 16 [2025-03-04 09:20:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:20:03,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:20:03,263 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 951 treesize of output 909 [2025-03-04 09:20:03,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 443 treesize of output 435 [2025-03-04 09:20:03,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 435 treesize of output 427 [2025-03-04 09:20:03,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 427 treesize of output 419 [2025-03-04 09:20:03,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 419 treesize of output 411 [2025-03-04 09:20:03,349 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1727 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1727) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2025-03-04 09:20:03,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442336512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:20:03,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:20:03,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2025-03-04 09:20:03,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138925335] [2025-03-04 09:20:03,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:20:03,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 09:20:03,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:20:03,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 09:20:03,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=709, Unknown=1, NotChecked=54, Total=870 [2025-03-04 09:20:03,351 INFO L87 Difference]: Start difference. First operand 5203 states and 7731 transitions. Second operand has 24 states, 21 states have (on average 6.190476190476191) internal successors, (130), 24 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:20:07,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:20:07,036 INFO L93 Difference]: Finished difference Result 5205 states and 7744 transitions. [2025-03-04 09:20:07,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:20:07,036 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.190476190476191) internal successors, (130), 24 states have internal predecessors, (130), 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-03-04 09:20:07,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:20:07,041 INFO L225 Difference]: With dead ends: 5205 [2025-03-04 09:20:07,041 INFO L226 Difference]: Without dead ends: 5205 [2025-03-04 09:20:07,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=1017, Unknown=1, NotChecked=66, Total=1260 [2025-03-04 09:20:07,041 INFO L435 NwaCegarLoop]: 1771 mSDtfsCounter, 2677 mSDsluCounter, 14252 mSDsCounter, 0 mSdLazyCounter, 11209 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2695 SdHoareTripleChecker+Valid, 16023 SdHoareTripleChecker+Invalid, 11254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 11209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:20:07,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2695 Valid, 16023 Invalid, 11254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 11209 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-04 09:20:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5205 states. [2025-03-04 09:20:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5205 to 5181. [2025-03-04 09:20:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5181 states, 4442 states have (on average 1.7217469608284557) internal successors, (7648), 5151 states have internal predecessors, (7648), 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-03-04 09:20:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 7706 transitions. [2025-03-04 09:20:07,075 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 7706 transitions. Word has length 99 [2025-03-04 09:20:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:20:07,075 INFO L471 AbstractCegarLoop]: Abstraction has 5181 states and 7706 transitions. [2025-03-04 09:20:07,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.190476190476191) internal successors, (130), 24 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:20:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 7706 transitions. [2025-03-04 09:20:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 09:20:07,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:20:07,075 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, 1, 1] [2025-03-04 09:20:07,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 09:20:07,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 09:20:07,276 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr863REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-04 09:20:07,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:20:07,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1169227464, now seen corresponding path program 1 times [2025-03-04 09:20:07,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:20:07,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131034233] [2025-03-04 09:20:07,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:20:07,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:20:07,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:20:07,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:20:07,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:20:07,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:20:07,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-03-04 09:20:07,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:20:07,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131034233] [2025-03-04 09:20:07,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131034233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:20:07,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:20:07,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 09:20:07,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877507655] [2025-03-04 09:20:07,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:20:07,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 09:20:07,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:20:07,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 09:20:07,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-04 09:20:07,662 INFO L87 Difference]: Start difference. First operand 5181 states and 7706 transitions. Second operand has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:20:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:20:10,698 INFO L93 Difference]: Finished difference Result 5212 states and 7752 transitions. [2025-03-04 09:20:10,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:20:10,699 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 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 101 [2025-03-04 09:20:10,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:20:10,703 INFO L225 Difference]: With dead ends: 5212 [2025-03-04 09:20:10,703 INFO L226 Difference]: Without dead ends: 5212 [2025-03-04 09:20:10,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-03-04 09:20:10,704 INFO L435 NwaCegarLoop]: 1764 mSDtfsCounter, 2651 mSDsluCounter, 15696 mSDsCounter, 0 mSdLazyCounter, 9856 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2669 SdHoareTripleChecker+Valid, 17460 SdHoareTripleChecker+Invalid, 9879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 9856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:20:10,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2669 Valid, 17460 Invalid, 9879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 9856 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-04 09:20:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5212 states. [2025-03-04 09:20:10,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5212 to 5208. [2025-03-04 09:20:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5208 states, 4468 states have (on average 1.718218442256043) internal successors, (7677), 5176 states have internal predecessors, (7677), 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-03-04 09:20:10,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5208 states to 5208 states and 7737 transitions. [2025-03-04 09:20:10,737 INFO L78 Accepts]: Start accepts. Automaton has 5208 states and 7737 transitions. Word has length 101 [2025-03-04 09:20:10,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:20:10,737 INFO L471 AbstractCegarLoop]: Abstraction has 5208 states and 7737 transitions. [2025-03-04 09:20:10,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:20:10,737 INFO L276 IsEmpty]: Start isEmpty. Operand 5208 states and 7737 transitions. [2025-03-04 09:20:10,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 09:20:10,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:20:10,738 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, 1, 1] [2025-03-04 09:20:10,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 09:20:10,738 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr864REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2025-03-04 09:20:10,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:20:10,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1169227465, now seen corresponding path program 1 times [2025-03-04 09:20:10,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:20:10,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178663843] [2025-03-04 09:20:10,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:20:10,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:20:10,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:20:10,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:20:10,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:20:10,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:20:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:20:11,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:20:11,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178663843] [2025-03-04 09:20:11,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178663843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:20:11,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:20:11,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 09:20:11,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060856513] [2025-03-04 09:20:11,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:20:11,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:20:11,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:20:11,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:20:11,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:20:11,222 INFO L87 Difference]: Start difference. First operand 5208 states and 7737 transitions. Second operand has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 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)