./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0521.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0521.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:17:53,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:17:53,805 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:17:53,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:17:53,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:17:53,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:17:53,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:17:53,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:17:53,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:17:53,844 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:17:53,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:17:53,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:17:53,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:17:53,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:17:53,845 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:17:53,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:17:53,845 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:17:53,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:17:53,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:17:53,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:17:53,845 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:17:53,845 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:17:53,845 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:17:53,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:17:53,846 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:17:53,846 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:17:53,846 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:17:53,846 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:17:53,846 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:17:53,846 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:17:53,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:17:53,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:17:53,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:17:53,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:17:53,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:17:53,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:17:53,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:17:53,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:17:53,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:17:53,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:17:53,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:17:53,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:17:53,848 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 [2025-02-06 10:17:54,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:17:54,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:17:54,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:17:54,163 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:17:54,163 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:17:54,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0521.i [2025-02-06 10:17:55,469 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3666c4bd/b4a85d644b5744fa914e18e0a3ae9823/FLAG3926c28ee [2025-02-06 10:17:55,751 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:17:55,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i [2025-02-06 10:17:55,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3666c4bd/b4a85d644b5744fa914e18e0a3ae9823/FLAG3926c28ee [2025-02-06 10:17:55,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3666c4bd/b4a85d644b5744fa914e18e0a3ae9823 [2025-02-06 10:17:55,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:17:55,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:17:55,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:17:55,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:17:55,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:17:55,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:17:55" (1/1) ... [2025-02-06 10:17:55,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282bd43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:55, skipping insertion in model container [2025-02-06 10:17:55,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:17:55" (1/1) ... [2025-02-06 10:17:55,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:17:56,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:17:56,078 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:17:56,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:17:56,173 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:17:56,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:56 WrapperNode [2025-02-06 10:17:56,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:17:56,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:17:56,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:17:56,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:17:56,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:56" (1/1) ... [2025-02-06 10:17:56,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:56" (1/1) ... [2025-02-06 10:17:56,224 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 295 [2025-02-06 10:17:56,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:17:56,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:17:56,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:17:56,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:17:56,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:56" (1/1) ... [2025-02-06 10:17:56,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:56" (1/1) ... [2025-02-06 10:17:56,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:56" (1/1) ... [2025-02-06 10:17:56,283 INFO L175 MemorySlicer]: Split 76 memory accesses to 6 slices as follows [2, 16, 31, 3, 16, 8]. 41 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 0, 0, 1, 0, 2]. The 26 writes are split as follows [0, 8, 8, 1, 8, 1]. [2025-02-06 10:17:56,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:56" (1/1) ... [2025-02-06 10:17:56,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:56" (1/1) ... [2025-02-06 10:17:56,307 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:56" (1/1) ... [2025-02-06 10:17:56,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:56" (1/1) ... [2025-02-06 10:17:56,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:56" (1/1) ... [2025-02-06 10:17:56,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:56" (1/1) ... [2025-02-06 10:17:56,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:17:56,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:17:56,321 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:17:56,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:17:56,323 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:56" (1/1) ... [2025-02-06 10:17:56,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:17:56,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:56,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:17:56,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:17:56,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:17:56,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:17:56,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 10:17:56,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 10:17:56,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 10:17:56,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 10:17:56,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:17:56,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:17:56,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:17:56,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:17:56,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:17:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:17:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 10:17:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 10:17:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 10:17:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:17:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:17:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:17:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 10:17:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 10:17:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 10:17:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:17:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 10:17:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 10:17:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 10:17:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 10:17:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 10:17:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-06 10:17:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:17:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:17:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:17:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 10:17:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 10:17:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 10:17:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:17:56,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:17:56,566 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:17:56,567 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:17:57,299 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2025-02-06 10:17:57,299 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:17:57,321 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:17:57,323 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:17:57,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:17:57 BoogieIcfgContainer [2025-02-06 10:17:57,324 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:17:57,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:17:57,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:17:57,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:17:57,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:17:55" (1/3) ... [2025-02-06 10:17:57,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf6ac1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:17:57, skipping insertion in model container [2025-02-06 10:17:57,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:56" (2/3) ... [2025-02-06 10:17:57,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf6ac1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:17:57, skipping insertion in model container [2025-02-06 10:17:57,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:17:57" (3/3) ... [2025-02-06 10:17:57,335 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0521.i [2025-02-06 10:17:57,350 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:17:57,352 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0521.i that has 1 procedures, 310 locations, 1 initial locations, 8 loop locations, and 152 error locations. [2025-02-06 10:17:57,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:17:57,408 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;@105c5bc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:17:57,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2025-02-06 10:17:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 310 states, 157 states have (on average 2.178343949044586) internal successors, (342), 309 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:17:57,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:57,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:17:57,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr142REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:17:57,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash 361649017, now seen corresponding path program 1 times [2025-02-06 10:17:57,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:57,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861372155] [2025-02-06 10:17:57,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:57,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:57,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:17:57,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:17:57,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:57,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:57,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:57,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861372155] [2025-02-06 10:17:57,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861372155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:57,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:57,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:57,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326212352] [2025-02-06 10:17:57,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:57,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:17:57,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:57,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:17:57,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:17:57,584 INFO L87 Difference]: Start difference. First operand has 310 states, 157 states have (on average 2.178343949044586) internal successors, (342), 309 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:57,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:57,609 INFO L93 Difference]: Finished difference Result 310 states and 337 transitions. [2025-02-06 10:17:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:17:57,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-02-06 10:17:57,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:57,617 INFO L225 Difference]: With dead ends: 310 [2025-02-06 10:17:57,617 INFO L226 Difference]: Without dead ends: 308 [2025-02-06 10:17:57,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:17:57,620 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:57,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:17:57,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-06 10:17:57,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-02-06 10:17:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 156 states have (on average 2.1474358974358974) internal successors, (335), 307 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 335 transitions. [2025-02-06 10:17:57,658 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 335 transitions. Word has length 5 [2025-02-06 10:17:57,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:57,659 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 335 transitions. [2025-02-06 10:17:57,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 335 transitions. [2025-02-06 10:17:57,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:17:57,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:57,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:17:57,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:17:57,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr142REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:17:57,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:57,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1673790628, now seen corresponding path program 1 times [2025-02-06 10:17:57,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:57,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236966510] [2025-02-06 10:17:57,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:57,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:57,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:17:57,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:17:57,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:57,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:57,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:57,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236966510] [2025-02-06 10:17:57,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236966510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:57,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:57,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:57,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031844783] [2025-02-06 10:17:57,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:57,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:17:57,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:57,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:17:57,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:57,759 INFO L87 Difference]: Start difference. First operand 308 states and 335 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:58,029 INFO L93 Difference]: Finished difference Result 292 states and 319 transitions. [2025-02-06 10:17:58,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:17:58,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:17:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:58,031 INFO L225 Difference]: With dead ends: 292 [2025-02-06 10:17:58,031 INFO L226 Difference]: Without dead ends: 292 [2025-02-06 10:17:58,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:58,032 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 59 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:58,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 402 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:17:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-06 10:17:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-02-06 10:17:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 156 states have (on average 2.0448717948717947) internal successors, (319), 291 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 319 transitions. [2025-02-06 10:17:58,051 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 319 transitions. Word has length 6 [2025-02-06 10:17:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:58,051 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 319 transitions. [2025-02-06 10:17:58,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 319 transitions. [2025-02-06 10:17:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:17:58,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:58,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:17:58,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:17:58,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:17:58,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:58,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1673790627, now seen corresponding path program 1 times [2025-02-06 10:17:58,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:58,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542057315] [2025-02-06 10:17:58,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:58,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:58,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:17:58,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:17:58,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:58,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:58,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:58,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542057315] [2025-02-06 10:17:58,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542057315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:58,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:58,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:58,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823938549] [2025-02-06 10:17:58,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:58,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:17:58,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:58,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:17:58,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:58,145 INFO L87 Difference]: Start difference. First operand 292 states and 319 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:58,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:58,388 INFO L93 Difference]: Finished difference Result 276 states and 303 transitions. [2025-02-06 10:17:58,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:17:58,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:17:58,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:58,390 INFO L225 Difference]: With dead ends: 276 [2025-02-06 10:17:58,390 INFO L226 Difference]: Without dead ends: 276 [2025-02-06 10:17:58,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:58,391 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 59 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:58,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 411 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:17:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-02-06 10:17:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-02-06 10:17:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 156 states have (on average 1.9423076923076923) internal successors, (303), 275 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:58,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 303 transitions. [2025-02-06 10:17:58,404 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 303 transitions. Word has length 6 [2025-02-06 10:17:58,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:58,404 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 303 transitions. [2025-02-06 10:17:58,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 303 transitions. [2025-02-06 10:17:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:17:58,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:58,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:17:58,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:17:58,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr150REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:17:58,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1673789060, now seen corresponding path program 1 times [2025-02-06 10:17:58,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:58,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159245090] [2025-02-06 10:17:58,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:58,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:58,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:17:58,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:17:58,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:58,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:58,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:58,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159245090] [2025-02-06 10:17:58,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159245090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:58,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:58,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:58,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428250906] [2025-02-06 10:17:58,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:58,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:17:58,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:58,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:17:58,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:58,476 INFO L87 Difference]: Start difference. First operand 276 states and 303 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:58,680 INFO L93 Difference]: Finished difference Result 274 states and 301 transitions. [2025-02-06 10:17:58,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:17:58,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:17:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:58,681 INFO L225 Difference]: With dead ends: 274 [2025-02-06 10:17:58,681 INFO L226 Difference]: Without dead ends: 274 [2025-02-06 10:17:58,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:58,682 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 6 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:58,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 445 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:17:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-02-06 10:17:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2025-02-06 10:17:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 156 states have (on average 1.9294871794871795) internal successors, (301), 273 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 301 transitions. [2025-02-06 10:17:58,694 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 301 transitions. Word has length 6 [2025-02-06 10:17:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:58,694 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 301 transitions. [2025-02-06 10:17:58,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 301 transitions. [2025-02-06 10:17:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:17:58,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:58,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:17:58,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:17:58,695 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:17:58,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1673789059, now seen corresponding path program 1 times [2025-02-06 10:17:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:58,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15848986] [2025-02-06 10:17:58,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:58,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:58,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:17:58,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:17:58,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:58,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:58,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:58,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15848986] [2025-02-06 10:17:58,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15848986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:58,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:58,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:58,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393494897] [2025-02-06 10:17:58,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:58,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:17:58,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:58,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:17:58,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:58,772 INFO L87 Difference]: Start difference. First operand 274 states and 301 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:58,935 INFO L93 Difference]: Finished difference Result 272 states and 299 transitions. [2025-02-06 10:17:58,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:17:58,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:17:58,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:58,938 INFO L225 Difference]: With dead ends: 272 [2025-02-06 10:17:58,938 INFO L226 Difference]: Without dead ends: 272 [2025-02-06 10:17:58,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:58,939 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 6 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:58,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 455 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:17:58,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-02-06 10:17:58,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2025-02-06 10:17:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 156 states have (on average 1.9166666666666667) internal successors, (299), 271 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 299 transitions. [2025-02-06 10:17:58,951 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 299 transitions. Word has length 6 [2025-02-06 10:17:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:58,951 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 299 transitions. [2025-02-06 10:17:58,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:58,953 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 299 transitions. [2025-02-06 10:17:58,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:17:58,954 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:58,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:58,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:17:58,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr140REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:17:58,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:58,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2099951673, now seen corresponding path program 1 times [2025-02-06 10:17:58,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:58,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768388669] [2025-02-06 10:17:58,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:58,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:58,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:17:58,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:17:58,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:58,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:59,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:59,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768388669] [2025-02-06 10:17:59,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768388669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:59,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:59,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:17:59,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414423826] [2025-02-06 10:17:59,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:59,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:17:59,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:59,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:17:59,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:17:59,050 INFO L87 Difference]: Start difference. First operand 272 states and 299 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:59,122 INFO L93 Difference]: Finished difference Result 335 states and 370 transitions. [2025-02-06 10:17:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:17:59,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:17:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:59,124 INFO L225 Difference]: With dead ends: 335 [2025-02-06 10:17:59,124 INFO L226 Difference]: Without dead ends: 335 [2025-02-06 10:17:59,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:17:59,125 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 67 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:59,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 861 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:59,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-02-06 10:17:59,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 277. [2025-02-06 10:17:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 161 states have (on average 1.8944099378881987) internal successors, (305), 276 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 305 transitions. [2025-02-06 10:17:59,131 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 305 transitions. Word has length 8 [2025-02-06 10:17:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:59,131 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 305 transitions. [2025-02-06 10:17:59,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 305 transitions. [2025-02-06 10:17:59,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:17:59,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:59,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:59,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:17:59,132 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:17:59,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:59,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1125905393, now seen corresponding path program 1 times [2025-02-06 10:17:59,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:59,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035539813] [2025-02-06 10:17:59,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:59,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:59,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:17:59,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:17:59,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:59,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:59,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:59,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:59,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035539813] [2025-02-06 10:17:59,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035539813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:59,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:59,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:59,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464220699] [2025-02-06 10:17:59,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:59,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:17:59,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:59,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:17:59,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:59,199 INFO L87 Difference]: Start difference. First operand 277 states and 305 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:59,365 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2025-02-06 10:17:59,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:17:59,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-02-06 10:17:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:59,367 INFO L225 Difference]: With dead ends: 275 [2025-02-06 10:17:59,367 INFO L226 Difference]: Without dead ends: 275 [2025-02-06 10:17:59,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:59,368 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 2 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:59,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 444 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:17:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-06 10:17:59,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-02-06 10:17:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 161 states have (on average 1.8819875776397517) internal successors, (303), 274 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 303 transitions. [2025-02-06 10:17:59,373 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 303 transitions. Word has length 11 [2025-02-06 10:17:59,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:59,373 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 303 transitions. [2025-02-06 10:17:59,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 303 transitions. [2025-02-06 10:17:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:17:59,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:59,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:59,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:17:59,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:17:59,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:59,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1125905394, now seen corresponding path program 1 times [2025-02-06 10:17:59,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:59,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696572212] [2025-02-06 10:17:59,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:59,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:59,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:17:59,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:17:59,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:59,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:59,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696572212] [2025-02-06 10:17:59,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696572212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:59,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:59,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:59,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738481965] [2025-02-06 10:17:59,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:59,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:17:59,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:59,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:17:59,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:59,468 INFO L87 Difference]: Start difference. First operand 275 states and 303 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:59,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:59,627 INFO L93 Difference]: Finished difference Result 273 states and 301 transitions. [2025-02-06 10:17:59,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:17:59,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-02-06 10:17:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:59,629 INFO L225 Difference]: With dead ends: 273 [2025-02-06 10:17:59,629 INFO L226 Difference]: Without dead ends: 273 [2025-02-06 10:17:59,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:59,629 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:59,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 454 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-02-06 10:17:59,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-02-06 10:17:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 161 states have (on average 1.8695652173913044) internal successors, (301), 272 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 301 transitions. [2025-02-06 10:17:59,638 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 301 transitions. Word has length 11 [2025-02-06 10:17:59,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:59,638 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 301 transitions. [2025-02-06 10:17:59,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 301 transitions. [2025-02-06 10:17:59,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 10:17:59,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:59,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:59,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:17:59,640 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr132REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:17:59,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:59,640 INFO L85 PathProgramCache]: Analyzing trace with hash -941595653, now seen corresponding path program 1 times [2025-02-06 10:17:59,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:59,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382118734] [2025-02-06 10:17:59,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:59,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:59,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 10:17:59,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 10:17:59,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:59,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:59,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:59,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382118734] [2025-02-06 10:17:59,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382118734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:59,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:59,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:17:59,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163355181] [2025-02-06 10:17:59,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:59,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:17:59,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:59,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:17:59,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:17:59,807 INFO L87 Difference]: Start difference. First operand 273 states and 301 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:59,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:59,960 INFO L93 Difference]: Finished difference Result 323 states and 358 transitions. [2025-02-06 10:17:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:17:59,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2025-02-06 10:17:59,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:59,962 INFO L225 Difference]: With dead ends: 323 [2025-02-06 10:17:59,962 INFO L226 Difference]: Without dead ends: 323 [2025-02-06 10:17:59,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:17:59,963 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 77 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:59,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1403 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:59,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-02-06 10:17:59,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 276. [2025-02-06 10:17:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 164 states have (on average 1.853658536585366) internal successors, (304), 275 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 304 transitions. [2025-02-06 10:17:59,969 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 304 transitions. Word has length 13 [2025-02-06 10:17:59,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:59,971 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 304 transitions. [2025-02-06 10:17:59,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:59,971 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 304 transitions. [2025-02-06 10:17:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:17:59,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:59,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:59,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:17:59,972 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:17:59,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:59,972 INFO L85 PathProgramCache]: Analyzing trace with hash 840734667, now seen corresponding path program 1 times [2025-02-06 10:17:59,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:59,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59511845] [2025-02-06 10:17:59,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:59,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:59,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:17:59,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:17:59,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:59,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:00,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:00,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59511845] [2025-02-06 10:18:00,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59511845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:00,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:00,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:18:00,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463648036] [2025-02-06 10:18:00,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:00,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:18:00,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:00,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:18:00,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:18:00,047 INFO L87 Difference]: Start difference. First operand 276 states and 304 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:00,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:00,128 INFO L93 Difference]: Finished difference Result 397 states and 437 transitions. [2025-02-06 10:18:00,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:18:00,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 10:18:00,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:00,129 INFO L225 Difference]: With dead ends: 397 [2025-02-06 10:18:00,130 INFO L226 Difference]: Without dead ends: 397 [2025-02-06 10:18:00,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:18:00,130 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 130 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:00,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1107 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-02-06 10:18:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 337. [2025-02-06 10:18:00,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 225 states have (on average 1.9066666666666667) internal successors, (429), 336 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 429 transitions. [2025-02-06 10:18:00,143 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 429 transitions. Word has length 14 [2025-02-06 10:18:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:00,143 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 429 transitions. [2025-02-06 10:18:00,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 429 transitions. [2025-02-06 10:18:00,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:18:00,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:00,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:00,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:18:00,145 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:00,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:00,146 INFO L85 PathProgramCache]: Analyzing trace with hash 492193220, now seen corresponding path program 1 times [2025-02-06 10:18:00,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:00,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686367122] [2025-02-06 10:18:00,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:00,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:00,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:18:00,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:18:00,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:00,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:00,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:00,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686367122] [2025-02-06 10:18:00,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686367122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:00,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:00,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:18:00,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982785779] [2025-02-06 10:18:00,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:00,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:18:00,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:00,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:18:00,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:18:00,190 INFO L87 Difference]: Start difference. First operand 337 states and 429 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:00,368 INFO L93 Difference]: Finished difference Result 321 states and 397 transitions. [2025-02-06 10:18:00,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:18:00,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 10:18:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:00,370 INFO L225 Difference]: With dead ends: 321 [2025-02-06 10:18:00,370 INFO L226 Difference]: Without dead ends: 321 [2025-02-06 10:18:00,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:18:00,371 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 59 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:00,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 342 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:18:00,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-02-06 10:18:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2025-02-06 10:18:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 225 states have (on average 1.7644444444444445) internal successors, (397), 320 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 397 transitions. [2025-02-06 10:18:00,377 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 397 transitions. Word has length 16 [2025-02-06 10:18:00,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:00,377 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 397 transitions. [2025-02-06 10:18:00,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 397 transitions. [2025-02-06 10:18:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:18:00,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:00,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:00,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:18:00,378 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:00,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:00,378 INFO L85 PathProgramCache]: Analyzing trace with hash 492193221, now seen corresponding path program 1 times [2025-02-06 10:18:00,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:00,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56441091] [2025-02-06 10:18:00,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:00,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:00,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:18:00,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:18:00,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:00,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:00,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:00,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56441091] [2025-02-06 10:18:00,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56441091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:00,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:00,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:18:00,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635189861] [2025-02-06 10:18:00,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:00,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:18:00,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:00,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:18:00,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:18:00,438 INFO L87 Difference]: Start difference. First operand 321 states and 397 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:00,592 INFO L93 Difference]: Finished difference Result 305 states and 365 transitions. [2025-02-06 10:18:00,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:18:00,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 10:18:00,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:00,594 INFO L225 Difference]: With dead ends: 305 [2025-02-06 10:18:00,594 INFO L226 Difference]: Without dead ends: 305 [2025-02-06 10:18:00,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:18:00,595 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 59 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:00,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 351 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:00,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-06 10:18:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-02-06 10:18:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 225 states have (on average 1.6222222222222222) internal successors, (365), 304 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 365 transitions. [2025-02-06 10:18:00,602 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 365 transitions. Word has length 16 [2025-02-06 10:18:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:00,603 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 365 transitions. [2025-02-06 10:18:00,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 365 transitions. [2025-02-06 10:18:00,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:18:00,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:00,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:00,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:18:00,603 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:00,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:00,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1674584199, now seen corresponding path program 1 times [2025-02-06 10:18:00,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:00,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489740665] [2025-02-06 10:18:00,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:00,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:00,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:18:00,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:18:00,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:00,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:00,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:00,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489740665] [2025-02-06 10:18:00,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489740665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:00,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:00,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:18:00,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111026477] [2025-02-06 10:18:00,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:00,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:18:00,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:00,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:18:00,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:18:00,644 INFO L87 Difference]: Start difference. First operand 305 states and 365 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:00,660 INFO L93 Difference]: Finished difference Result 290 states and 340 transitions. [2025-02-06 10:18:00,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:18:00,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 10:18:00,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:00,662 INFO L225 Difference]: With dead ends: 290 [2025-02-06 10:18:00,662 INFO L226 Difference]: Without dead ends: 290 [2025-02-06 10:18:00,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:18:00,662 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:00,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:18:00,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-02-06 10:18:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-02-06 10:18:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 210 states have (on average 1.619047619047619) internal successors, (340), 289 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 340 transitions. [2025-02-06 10:18:00,669 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 340 transitions. Word has length 16 [2025-02-06 10:18:00,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:00,671 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 340 transitions. [2025-02-06 10:18:00,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:00,671 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 340 transitions. [2025-02-06 10:18:00,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:18:00,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:00,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:00,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:18:00,672 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:00,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:00,672 INFO L85 PathProgramCache]: Analyzing trace with hash 551284673, now seen corresponding path program 1 times [2025-02-06 10:18:00,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:00,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264894543] [2025-02-06 10:18:00,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:00,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:00,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:18:00,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:18:00,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:00,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:00,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:00,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264894543] [2025-02-06 10:18:00,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264894543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:00,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:00,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:18:00,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961789274] [2025-02-06 10:18:00,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:00,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:18:00,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:00,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:18:00,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:18:00,772 INFO L87 Difference]: Start difference. First operand 290 states and 340 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:00,856 INFO L93 Difference]: Finished difference Result 308 states and 343 transitions. [2025-02-06 10:18:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:18:00,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 10:18:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:00,858 INFO L225 Difference]: With dead ends: 308 [2025-02-06 10:18:00,858 INFO L226 Difference]: Without dead ends: 308 [2025-02-06 10:18:00,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:18:00,858 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 63 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:00,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 978 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-06 10:18:00,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 288. [2025-02-06 10:18:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 208 states have (on average 1.6105769230769231) internal successors, (335), 287 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 335 transitions. [2025-02-06 10:18:00,864 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 335 transitions. Word has length 18 [2025-02-06 10:18:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:00,864 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 335 transitions. [2025-02-06 10:18:00,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 335 transitions. [2025-02-06 10:18:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:18:00,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:00,865 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:00,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:18:00,865 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr140REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:00,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:00,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2029116920, now seen corresponding path program 1 times [2025-02-06 10:18:00,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:00,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022881382] [2025-02-06 10:18:00,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:00,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:00,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:18:00,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:18:00,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:00,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:01,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:01,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022881382] [2025-02-06 10:18:01,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022881382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:01,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:01,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:18:01,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277670975] [2025-02-06 10:18:01,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:01,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:18:01,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:01,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:18:01,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:18:01,019 INFO L87 Difference]: Start difference. First operand 288 states and 335 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:01,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:01,421 INFO L93 Difference]: Finished difference Result 309 states and 358 transitions. [2025-02-06 10:18:01,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:18:01,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-02-06 10:18:01,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:01,424 INFO L225 Difference]: With dead ends: 309 [2025-02-06 10:18:01,424 INFO L226 Difference]: Without dead ends: 309 [2025-02-06 10:18:01,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:18:01,424 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 82 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:01,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 736 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:18:01,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-06 10:18:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 290. [2025-02-06 10:18:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 212 states have (on average 1.6037735849056605) internal successors, (340), 289 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 340 transitions. [2025-02-06 10:18:01,435 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 340 transitions. Word has length 19 [2025-02-06 10:18:01,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:01,435 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 340 transitions. [2025-02-06 10:18:01,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:01,435 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 340 transitions. [2025-02-06 10:18:01,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:18:01,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:01,437 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:01,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:18:01,437 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr141REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:01,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:01,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2029116919, now seen corresponding path program 1 times [2025-02-06 10:18:01,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:01,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739554499] [2025-02-06 10:18:01,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:01,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:01,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:18:01,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:18:01,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:01,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:01,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:01,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739554499] [2025-02-06 10:18:01,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739554499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:01,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:01,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:18:01,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073690856] [2025-02-06 10:18:01,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:01,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:18:01,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:01,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:18:01,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:18:01,654 INFO L87 Difference]: Start difference. First operand 290 states and 340 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:02,027 INFO L93 Difference]: Finished difference Result 297 states and 347 transitions. [2025-02-06 10:18:02,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:18:02,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-02-06 10:18:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:02,029 INFO L225 Difference]: With dead ends: 297 [2025-02-06 10:18:02,029 INFO L226 Difference]: Without dead ends: 297 [2025-02-06 10:18:02,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:18:02,030 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 64 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:02,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 590 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:18:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-02-06 10:18:02,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 289. [2025-02-06 10:18:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 212 states have (on average 1.599056603773585) internal successors, (339), 288 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 339 transitions. [2025-02-06 10:18:02,035 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 339 transitions. Word has length 19 [2025-02-06 10:18:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:02,036 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 339 transitions. [2025-02-06 10:18:02,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 339 transitions. [2025-02-06 10:18:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:18:02,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:02,038 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] [2025-02-06 10:18:02,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:18:02,038 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:02,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:02,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2113283354, now seen corresponding path program 1 times [2025-02-06 10:18:02,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:02,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755708892] [2025-02-06 10:18:02,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:02,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:18:02,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:18:02,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:02,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:02,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:02,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755708892] [2025-02-06 10:18:02,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755708892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:02,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:02,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:18:02,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220732009] [2025-02-06 10:18:02,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:02,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:18:02,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:02,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:18:02,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:18:02,165 INFO L87 Difference]: Start difference. First operand 289 states and 339 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:02,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:02,466 INFO L93 Difference]: Finished difference Result 302 states and 339 transitions. [2025-02-06 10:18:02,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:18:02,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-06 10:18:02,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:02,468 INFO L225 Difference]: With dead ends: 302 [2025-02-06 10:18:02,468 INFO L226 Difference]: Without dead ends: 300 [2025-02-06 10:18:02,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:18:02,468 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 49 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:02,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 640 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:18:02,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-02-06 10:18:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 288. [2025-02-06 10:18:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 211 states have (on average 1.5971563981042654) internal successors, (337), 287 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 337 transitions. [2025-02-06 10:18:02,474 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 337 transitions. Word has length 23 [2025-02-06 10:18:02,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:02,474 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 337 transitions. [2025-02-06 10:18:02,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:02,475 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 337 transitions. [2025-02-06 10:18:02,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:18:02,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:02,475 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] [2025-02-06 10:18:02,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:18:02,475 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:02,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:02,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2112167316, now seen corresponding path program 1 times [2025-02-06 10:18:02,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:02,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823516499] [2025-02-06 10:18:02,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:02,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:02,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:18:02,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:18:02,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:02,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:02,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:02,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823516499] [2025-02-06 10:18:02,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823516499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:02,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:02,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:18:02,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951408428] [2025-02-06 10:18:02,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:02,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:18:02,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:02,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:18:02,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:18:02,667 INFO L87 Difference]: Start difference. First operand 288 states and 337 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:02,832 INFO L93 Difference]: Finished difference Result 304 states and 340 transitions. [2025-02-06 10:18:02,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:18:02,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-06 10:18:02,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:02,833 INFO L225 Difference]: With dead ends: 304 [2025-02-06 10:18:02,833 INFO L226 Difference]: Without dead ends: 304 [2025-02-06 10:18:02,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:18:02,834 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 76 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:02,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1442 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-02-06 10:18:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 274. [2025-02-06 10:18:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 197 states have (on average 1.5939086294416243) internal successors, (314), 273 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 314 transitions. [2025-02-06 10:18:02,839 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 314 transitions. Word has length 23 [2025-02-06 10:18:02,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:02,839 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 314 transitions. [2025-02-06 10:18:02,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 314 transitions. [2025-02-06 10:18:02,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:18:02,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:02,840 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:02,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:18:02,840 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr132REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:02,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:02,841 INFO L85 PathProgramCache]: Analyzing trace with hash 32621452, now seen corresponding path program 1 times [2025-02-06 10:18:02,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:02,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373092024] [2025-02-06 10:18:02,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:02,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:02,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:18:02,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:18:02,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:02,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:02,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:02,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:02,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373092024] [2025-02-06 10:18:02,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373092024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:02,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:02,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:18:02,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141440546] [2025-02-06 10:18:02,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:02,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:18:02,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:02,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:18:02,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:18:02,895 INFO L87 Difference]: Start difference. First operand 274 states and 314 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:02,949 INFO L93 Difference]: Finished difference Result 282 states and 321 transitions. [2025-02-06 10:18:02,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:18:02,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:18:02,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:02,950 INFO L225 Difference]: With dead ends: 282 [2025-02-06 10:18:02,950 INFO L226 Difference]: Without dead ends: 282 [2025-02-06 10:18:02,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:18:02,951 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 66 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:02,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 975 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:18:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-06 10:18:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 274. [2025-02-06 10:18:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 197 states have (on average 1.5888324873096447) internal successors, (313), 273 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 313 transitions. [2025-02-06 10:18:02,956 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 313 transitions. Word has length 24 [2025-02-06 10:18:02,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:02,956 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 313 transitions. [2025-02-06 10:18:02,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 313 transitions. [2025-02-06 10:18:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:18:02,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:02,957 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] [2025-02-06 10:18:02,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:18:02,957 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:02,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:02,958 INFO L85 PathProgramCache]: Analyzing trace with hash 13450383, now seen corresponding path program 1 times [2025-02-06 10:18:02,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:02,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756565972] [2025-02-06 10:18:02,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:02,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:02,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:18:02,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:18:02,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:02,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:02,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:02,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756565972] [2025-02-06 10:18:02,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756565972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:02,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:02,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:18:02,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121691949] [2025-02-06 10:18:02,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:02,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:18:02,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:02,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:18:02,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:18:02,990 INFO L87 Difference]: Start difference. First operand 274 states and 313 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:03,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:03,002 INFO L93 Difference]: Finished difference Result 259 states and 288 transitions. [2025-02-06 10:18:03,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:18:03,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-06 10:18:03,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:03,004 INFO L225 Difference]: With dead ends: 259 [2025-02-06 10:18:03,004 INFO L226 Difference]: Without dead ends: 242 [2025-02-06 10:18:03,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:18:03,005 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:03,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:18:03,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-02-06 10:18:03,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2025-02-06 10:18:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 165 states have (on average 1.6424242424242423) internal successors, (271), 241 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 271 transitions. [2025-02-06 10:18:03,009 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 271 transitions. Word has length 26 [2025-02-06 10:18:03,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:03,009 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 271 transitions. [2025-02-06 10:18:03,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:03,009 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 271 transitions. [2025-02-06 10:18:03,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:18:03,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:03,010 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:03,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 10:18:03,010 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr132REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:03,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:03,010 INFO L85 PathProgramCache]: Analyzing trace with hash 846595336, now seen corresponding path program 1 times [2025-02-06 10:18:03,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:03,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735606454] [2025-02-06 10:18:03,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:03,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:03,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:18:03,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:18:03,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:03,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:03,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:03,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735606454] [2025-02-06 10:18:03,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735606454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:03,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:03,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 10:18:03,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742573607] [2025-02-06 10:18:03,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:03,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:18:03,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:03,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:18:03,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:18:03,370 INFO L87 Difference]: Start difference. First operand 242 states and 271 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:04,140 INFO L93 Difference]: Finished difference Result 244 states and 273 transitions. [2025-02-06 10:18:04,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:18:04,140 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-06 10:18:04,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:04,141 INFO L225 Difference]: With dead ends: 244 [2025-02-06 10:18:04,141 INFO L226 Difference]: Without dead ends: 244 [2025-02-06 10:18:04,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:18:04,142 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 76 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:04,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1472 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 10:18:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-02-06 10:18:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2025-02-06 10:18:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 165 states have (on average 1.6363636363636365) internal successors, (270), 240 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 270 transitions. [2025-02-06 10:18:04,147 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 270 transitions. Word has length 26 [2025-02-06 10:18:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:04,147 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 270 transitions. [2025-02-06 10:18:04,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 270 transitions. [2025-02-06 10:18:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:18:04,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:04,148 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:04,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 10:18:04,148 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr133REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:04,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:04,149 INFO L85 PathProgramCache]: Analyzing trace with hash 846595337, now seen corresponding path program 1 times [2025-02-06 10:18:04,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:04,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588783149] [2025-02-06 10:18:04,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:04,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:04,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:18:04,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:18:04,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:04,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:04,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:04,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588783149] [2025-02-06 10:18:04,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588783149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:04,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:04,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 10:18:04,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524102066] [2025-02-06 10:18:04,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:04,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:18:04,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:04,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:18:04,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:18:04,728 INFO L87 Difference]: Start difference. First operand 241 states and 270 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:05,596 INFO L93 Difference]: Finished difference Result 243 states and 272 transitions. [2025-02-06 10:18:05,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:18:05,596 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-06 10:18:05,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:05,597 INFO L225 Difference]: With dead ends: 243 [2025-02-06 10:18:05,597 INFO L226 Difference]: Without dead ends: 243 [2025-02-06 10:18:05,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:18:05,599 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 76 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:05,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1510 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 10:18:05,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-06 10:18:05,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2025-02-06 10:18:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 165 states have (on average 1.6303030303030304) internal successors, (269), 239 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 269 transitions. [2025-02-06 10:18:05,603 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 269 transitions. Word has length 26 [2025-02-06 10:18:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:05,603 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 269 transitions. [2025-02-06 10:18:05,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 269 transitions. [2025-02-06 10:18:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:18:05,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:05,604 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:05,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 10:18:05,604 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:05,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:05,604 INFO L85 PathProgramCache]: Analyzing trace with hash 440080478, now seen corresponding path program 1 times [2025-02-06 10:18:05,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:05,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037100529] [2025-02-06 10:18:05,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:05,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:05,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:18:05,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:18:05,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:05,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:05,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:05,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037100529] [2025-02-06 10:18:05,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037100529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:05,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:05,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:18:05,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166104013] [2025-02-06 10:18:05,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:05,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:18:05,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:05,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:18:05,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:18:05,764 INFO L87 Difference]: Start difference. First operand 240 states and 269 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:05,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:05,903 INFO L93 Difference]: Finished difference Result 258 states and 289 transitions. [2025-02-06 10:18:05,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:18:05,904 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 27 [2025-02-06 10:18:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:05,905 INFO L225 Difference]: With dead ends: 258 [2025-02-06 10:18:05,905 INFO L226 Difference]: Without dead ends: 258 [2025-02-06 10:18:05,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:18:05,905 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 110 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:05,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1564 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:05,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-06 10:18:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 240. [2025-02-06 10:18:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 165 states have (on average 1.6242424242424243) internal successors, (268), 239 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 268 transitions. [2025-02-06 10:18:05,910 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 268 transitions. Word has length 27 [2025-02-06 10:18:05,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:05,910 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 268 transitions. [2025-02-06 10:18:05,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 268 transitions. [2025-02-06 10:18:05,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:18:05,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:05,911 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:05,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 10:18:05,911 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr126REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:05,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:05,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1322856260, now seen corresponding path program 1 times [2025-02-06 10:18:05,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:05,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247982908] [2025-02-06 10:18:05,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:05,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:05,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:18:05,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:18:05,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:05,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:18:06,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:06,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247982908] [2025-02-06 10:18:06,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247982908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:06,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:06,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:18:06,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866522310] [2025-02-06 10:18:06,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:06,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:18:06,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:06,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:18:06,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:18:06,062 INFO L87 Difference]: Start difference. First operand 240 states and 268 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:06,279 INFO L93 Difference]: Finished difference Result 257 states and 288 transitions. [2025-02-06 10:18:06,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:18:06,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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 30 [2025-02-06 10:18:06,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:06,281 INFO L225 Difference]: With dead ends: 257 [2025-02-06 10:18:06,281 INFO L226 Difference]: Without dead ends: 257 [2025-02-06 10:18:06,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:18:06,282 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 21 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:06,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 719 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:18:06,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-02-06 10:18:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 239. [2025-02-06 10:18:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 165 states have (on average 1.6181818181818182) internal successors, (267), 238 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 267 transitions. [2025-02-06 10:18:06,288 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 267 transitions. Word has length 30 [2025-02-06 10:18:06,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:06,288 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 267 transitions. [2025-02-06 10:18:06,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 267 transitions. [2025-02-06 10:18:06,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:18:06,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:06,289 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:06,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 10:18:06,289 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr127REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:06,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:06,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1322856261, now seen corresponding path program 1 times [2025-02-06 10:18:06,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:06,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779354604] [2025-02-06 10:18:06,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:06,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:06,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:18:06,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:18:06,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:06,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:06,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:06,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779354604] [2025-02-06 10:18:06,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779354604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:06,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:06,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:18:06,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197858797] [2025-02-06 10:18:06,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:06,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:18:06,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:06,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:18:06,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:18:06,658 INFO L87 Difference]: Start difference. First operand 239 states and 267 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:07,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:07,334 INFO L93 Difference]: Finished difference Result 264 states and 295 transitions. [2025-02-06 10:18:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:18:07,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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 30 [2025-02-06 10:18:07,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:07,335 INFO L225 Difference]: With dead ends: 264 [2025-02-06 10:18:07,335 INFO L226 Difference]: Without dead ends: 264 [2025-02-06 10:18:07,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:18:07,336 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 99 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:07,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1075 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:18:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-02-06 10:18:07,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 238. [2025-02-06 10:18:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 165 states have (on average 1.612121212121212) internal successors, (266), 237 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 266 transitions. [2025-02-06 10:18:07,345 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 266 transitions. Word has length 30 [2025-02-06 10:18:07,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:07,345 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 266 transitions. [2025-02-06 10:18:07,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 266 transitions. [2025-02-06 10:18:07,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:18:07,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:07,346 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:07,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 10:18:07,346 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:07,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:07,347 INFO L85 PathProgramCache]: Analyzing trace with hash -2058939300, now seen corresponding path program 1 times [2025-02-06 10:18:07,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:07,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845481955] [2025-02-06 10:18:07,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:07,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:07,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:18:07,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:18:07,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:07,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:07,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:07,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845481955] [2025-02-06 10:18:07,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845481955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:07,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:07,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 10:18:07,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860596719] [2025-02-06 10:18:07,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:07,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:18:07,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:07,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:18:07,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:18:07,578 INFO L87 Difference]: Start difference. First operand 238 states and 266 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:07,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:07,875 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2025-02-06 10:18:07,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:18:07,876 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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 33 [2025-02-06 10:18:07,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:07,877 INFO L225 Difference]: With dead ends: 241 [2025-02-06 10:18:07,877 INFO L226 Difference]: Without dead ends: 241 [2025-02-06 10:18:07,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:18:07,878 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 69 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:07,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 2156 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:18:07,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-02-06 10:18:07,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2025-02-06 10:18:07,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 166 states have (on average 1.608433734939759) internal successors, (267), 238 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:07,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 267 transitions. [2025-02-06 10:18:07,885 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 267 transitions. Word has length 33 [2025-02-06 10:18:07,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:07,885 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 267 transitions. [2025-02-06 10:18:07,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:07,885 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 267 transitions. [2025-02-06 10:18:07,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 10:18:07,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:07,886 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:07,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 10:18:07,886 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:07,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:07,887 INFO L85 PathProgramCache]: Analyzing trace with hash -723507937, now seen corresponding path program 1 times [2025-02-06 10:18:07,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:07,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330989919] [2025-02-06 10:18:07,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:07,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:07,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 10:18:07,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:18:07,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:07,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:08,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:08,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330989919] [2025-02-06 10:18:08,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330989919] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:08,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417675750] [2025-02-06 10:18:08,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:08,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:08,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:08,486 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:18:08,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:18:08,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 10:18:08,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:18:08,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:08,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:08,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 10:18:08,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:08,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:18:08,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:18:08,805 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 15 treesize of output 1 [2025-02-06 10:18:08,810 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 15 treesize of output 1 [2025-02-06 10:18:08,851 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 54 treesize of output 34 [2025-02-06 10:18:08,854 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2025-02-06 10:18:08,911 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 54 treesize of output 34 [2025-02-06 10:18:08,914 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2025-02-06 10:18:08,937 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 42 treesize of output 30 [2025-02-06 10:18:08,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2025-02-06 10:18:08,974 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 13 treesize of output 3 [2025-02-06 10:18:08,978 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 11 treesize of output 7 [2025-02-06 10:18:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:09,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:09,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:09,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417675750] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:09,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:09,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 19 [2025-02-06 10:18:09,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144076781] [2025-02-06 10:18:09,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:09,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 10:18:09,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:09,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 10:18:09,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:18:09,150 INFO L87 Difference]: Start difference. First operand 239 states and 267 transitions. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:09,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:09,702 INFO L93 Difference]: Finished difference Result 317 states and 354 transitions. [2025-02-06 10:18:09,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:18:09,702 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 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-02-06 10:18:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:09,703 INFO L225 Difference]: With dead ends: 317 [2025-02-06 10:18:09,703 INFO L226 Difference]: Without dead ends: 317 [2025-02-06 10:18:09,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:18:09,704 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 92 mSDsluCounter, 2506 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:09,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 2735 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:18:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-06 10:18:09,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 267. [2025-02-06 10:18:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 194 states have (on average 1.5309278350515463) internal successors, (297), 266 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 297 transitions. [2025-02-06 10:18:09,709 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 297 transitions. Word has length 34 [2025-02-06 10:18:09,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:09,709 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 297 transitions. [2025-02-06 10:18:09,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 297 transitions. [2025-02-06 10:18:09,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:18:09,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:09,709 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:09,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:18:09,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-06 10:18:09,914 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:09,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:09,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1773290280, now seen corresponding path program 1 times [2025-02-06 10:18:09,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:09,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284499186] [2025-02-06 10:18:09,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:09,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:09,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:18:09,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:18:09,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:09,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:10,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:10,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284499186] [2025-02-06 10:18:10,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284499186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:10,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:10,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 10:18:10,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094437694] [2025-02-06 10:18:10,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:10,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:18:10,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:10,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:18:10,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:18:10,612 INFO L87 Difference]: Start difference. First operand 267 states and 297 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:11,210 INFO L93 Difference]: Finished difference Result 267 states and 295 transitions. [2025-02-06 10:18:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:18:11,211 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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 35 [2025-02-06 10:18:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:11,212 INFO L225 Difference]: With dead ends: 267 [2025-02-06 10:18:11,212 INFO L226 Difference]: Without dead ends: 267 [2025-02-06 10:18:11,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:18:11,213 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 70 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2479 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:11,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2479 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:18:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-06 10:18:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-02-06 10:18:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 194 states have (on average 1.5206185567010309) internal successors, (295), 266 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 295 transitions. [2025-02-06 10:18:11,217 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 295 transitions. Word has length 35 [2025-02-06 10:18:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:11,217 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 295 transitions. [2025-02-06 10:18:11,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 295 transitions. [2025-02-06 10:18:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:18:11,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:11,218 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:11,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 10:18:11,218 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:11,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:11,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2113009160, now seen corresponding path program 1 times [2025-02-06 10:18:11,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:11,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567738053] [2025-02-06 10:18:11,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:11,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:11,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:18:11,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:18:11,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:11,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:11,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:18:11,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:11,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567738053] [2025-02-06 10:18:11,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567738053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:11,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:11,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:18:11,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359189110] [2025-02-06 10:18:11,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:11,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:18:11,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:11,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:18:11,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:18:11,381 INFO L87 Difference]: Start difference. First operand 267 states and 295 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:11,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:11,444 INFO L93 Difference]: Finished difference Result 273 states and 301 transitions. [2025-02-06 10:18:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:18:11,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 40 [2025-02-06 10:18:11,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:11,445 INFO L225 Difference]: With dead ends: 273 [2025-02-06 10:18:11,445 INFO L226 Difference]: Without dead ends: 273 [2025-02-06 10:18:11,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:18:11,446 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 2 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:11,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 956 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:18:11,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-02-06 10:18:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 272. [2025-02-06 10:18:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 199 states have (on average 1.5075376884422111) internal successors, (300), 271 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 300 transitions. [2025-02-06 10:18:11,451 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 300 transitions. Word has length 40 [2025-02-06 10:18:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:11,451 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 300 transitions. [2025-02-06 10:18:11,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 300 transitions. [2025-02-06 10:18:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 10:18:11,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:11,452 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:11,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 10:18:11,452 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:11,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1112114362, now seen corresponding path program 1 times [2025-02-06 10:18:11,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:11,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991088930] [2025-02-06 10:18:11,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:11,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:18:11,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:18:11,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:11,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:18:11,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:11,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991088930] [2025-02-06 10:18:11,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991088930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:11,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:11,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:18:11,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802212665] [2025-02-06 10:18:11,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:11,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:18:11,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:11,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:18:11,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:18:11,629 INFO L87 Difference]: Start difference. First operand 272 states and 300 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:12,061 INFO L93 Difference]: Finished difference Result 341 states and 380 transitions. [2025-02-06 10:18:12,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:18:12,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 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 41 [2025-02-06 10:18:12,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:12,063 INFO L225 Difference]: With dead ends: 341 [2025-02-06 10:18:12,063 INFO L226 Difference]: Without dead ends: 341 [2025-02-06 10:18:12,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:18:12,064 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 213 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:12,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 607 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:18:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-02-06 10:18:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 275. [2025-02-06 10:18:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 204 states have (on average 1.5049019607843137) internal successors, (307), 274 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 307 transitions. [2025-02-06 10:18:12,069 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 307 transitions. Word has length 41 [2025-02-06 10:18:12,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:12,069 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 307 transitions. [2025-02-06 10:18:12,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 307 transitions. [2025-02-06 10:18:12,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 10:18:12,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:12,070 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:12,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 10:18:12,070 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:12,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:12,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1112114361, now seen corresponding path program 1 times [2025-02-06 10:18:12,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:12,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989781989] [2025-02-06 10:18:12,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:12,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:12,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:18:12,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:18:12,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:12,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:18:12,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:12,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989781989] [2025-02-06 10:18:12,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989781989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:12,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:12,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:18:12,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140923265] [2025-02-06 10:18:12,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:12,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:18:12,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:12,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:18:12,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:18:12,405 INFO L87 Difference]: Start difference. First operand 275 states and 307 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:12,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:12,875 INFO L93 Difference]: Finished difference Result 358 states and 403 transitions. [2025-02-06 10:18:12,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:18:12,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 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 41 [2025-02-06 10:18:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:12,877 INFO L225 Difference]: With dead ends: 358 [2025-02-06 10:18:12,877 INFO L226 Difference]: Without dead ends: 358 [2025-02-06 10:18:12,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:18:12,878 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 129 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:12,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1036 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:18:12,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-06 10:18:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 337. [2025-02-06 10:18:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 266 states have (on average 1.5112781954887218) internal successors, (402), 336 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 402 transitions. [2025-02-06 10:18:12,883 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 402 transitions. Word has length 41 [2025-02-06 10:18:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:12,883 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 402 transitions. [2025-02-06 10:18:12,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 402 transitions. [2025-02-06 10:18:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 10:18:12,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:12,884 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:12,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 10:18:12,884 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:12,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:12,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1114530372, now seen corresponding path program 1 times [2025-02-06 10:18:12,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:12,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071230727] [2025-02-06 10:18:12,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:12,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:12,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:18:12,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:18:12,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:12,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:18:13,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:13,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071230727] [2025-02-06 10:18:13,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071230727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:13,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:13,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:18:13,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886999144] [2025-02-06 10:18:13,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:13,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:18:13,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:13,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:18:13,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:18:13,002 INFO L87 Difference]: Start difference. First operand 337 states and 402 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:13,181 INFO L93 Difference]: Finished difference Result 417 states and 471 transitions. [2025-02-06 10:18:13,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:18:13,182 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 45 [2025-02-06 10:18:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:13,183 INFO L225 Difference]: With dead ends: 417 [2025-02-06 10:18:13,183 INFO L226 Difference]: Without dead ends: 417 [2025-02-06 10:18:13,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:18:13,184 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 241 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:13,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1401 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-02-06 10:18:13,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 336. [2025-02-06 10:18:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 265 states have (on average 1.5018867924528303) internal successors, (398), 335 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:13,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 398 transitions. [2025-02-06 10:18:13,204 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 398 transitions. Word has length 45 [2025-02-06 10:18:13,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:13,204 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 398 transitions. [2025-02-06 10:18:13,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 398 transitions. [2025-02-06 10:18:13,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 10:18:13,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:13,205 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:13,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 10:18:13,205 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:13,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:13,205 INFO L85 PathProgramCache]: Analyzing trace with hash 292477486, now seen corresponding path program 2 times [2025-02-06 10:18:13,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:13,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590938505] [2025-02-06 10:18:13,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:18:13,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:13,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-06 10:18:13,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:18:13,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:18:13,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:14,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:14,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590938505] [2025-02-06 10:18:14,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590938505] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:14,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147153469] [2025-02-06 10:18:14,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:18:14,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:14,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:14,470 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:18:14,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:18:14,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-06 10:18:14,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:18:14,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:18:14,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:14,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-06 10:18:14,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:14,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:18:14,789 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:18:14,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 10:18:14,878 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:18:14,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-02-06 10:18:14,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 15 treesize of output 1 [2025-02-06 10:18:15,042 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 44 treesize of output 32 [2025-02-06 10:18:15,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:18:15,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 32 [2025-02-06 10:18:15,240 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 11 treesize of output 7 [2025-02-06 10:18:15,246 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 11 treesize of output 7 [2025-02-06 10:18:15,404 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 10:18:15,409 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 77 treesize of output 56 [2025-02-06 10:18:15,749 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 10:18:15,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 43 [2025-02-06 10:18:15,833 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 7 treesize of output 3 [2025-02-06 10:18:15,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2025-02-06 10:18:15,962 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 5 [2025-02-06 10:18:16,053 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 26 treesize of output 14 [2025-02-06 10:18:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:16,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:27,396 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_57| Int) (v_ArrVal_1110 Int) (v_ArrVal_1113 Int) (|v_ULTIMATE.start_main_~item~0#1.base_19| Int) (|v_ULTIMATE.start_main_~node~0#1.base_19| Int) (v_ArrVal_1109 Int)) (let ((.cse0 (store (store (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_19| v_ArrVal_1109) |v_ULTIMATE.start_main_~item~0#1.base_19| v_ArrVal_1110) |v_ULTIMATE.start_main_~#iter~0#1.base_57| v_ArrVal_1113))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~node~0#1.base_19|) 1)) (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_19|) 1)) (= (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|) 1) (< |v_ULTIMATE.start_main_~#iter~0#1.base_57| (+ |c_#StackHeapBarrier| 1))))) is different from false [2025-02-06 10:18:31,081 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_57| Int) (v_ArrVal_1110 Int) (v_ArrVal_1113 Int) (|v_ULTIMATE.start_main_~item~0#1.base_19| Int) (|v_ULTIMATE.start_main_~node~0#1.base_19| Int) (v_ArrVal_1109 Int)) (let ((.cse0 (store (store (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_19| v_ArrVal_1109) |v_ULTIMATE.start_main_~item~0#1.base_19| v_ArrVal_1110) |v_ULTIMATE.start_main_~#iter~0#1.base_57| v_ArrVal_1113))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~node~0#1.base_19|) 1)) (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_19|) 1)) (= (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) 1) (< |v_ULTIMATE.start_main_~#iter~0#1.base_57| (+ |c_#StackHeapBarrier| 1))))) is different from false [2025-02-06 10:18:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-06 10:18:31,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147153469] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:31,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:31,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 19] total 53 [2025-02-06 10:18:31,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461656642] [2025-02-06 10:18:31,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:31,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-06 10:18:31,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:31,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-06 10:18:31,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2476, Unknown=4, NotChecked=202, Total=2862 [2025-02-06 10:18:31,140 INFO L87 Difference]: Start difference. First operand 336 states and 398 transitions. Second operand has 54 states, 53 states have (on average 2.150943396226415) internal successors, (114), 54 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:35,231 INFO L93 Difference]: Finished difference Result 376 states and 445 transitions. [2025-02-06 10:18:35,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 10:18:35,231 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.150943396226415) internal successors, (114), 54 states have internal predecessors, (114), 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 45 [2025-02-06 10:18:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:35,233 INFO L225 Difference]: With dead ends: 376 [2025-02-06 10:18:35,233 INFO L226 Difference]: Without dead ends: 376 [2025-02-06 10:18:35,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=521, Invalid=4175, Unknown=4, NotChecked=270, Total=4970 [2025-02-06 10:18:35,235 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 561 mSDsluCounter, 4490 mSDsCounter, 0 mSdLazyCounter, 4748 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 4710 SdHoareTripleChecker+Invalid, 5223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 445 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:35,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 4710 Invalid, 5223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4748 Invalid, 0 Unknown, 445 Unchecked, 2.9s Time] [2025-02-06 10:18:35,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-02-06 10:18:35,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 335. [2025-02-06 10:18:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 265 states have (on average 1.4981132075471697) internal successors, (397), 334 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 397 transitions. [2025-02-06 10:18:35,240 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 397 transitions. Word has length 45 [2025-02-06 10:18:35,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:35,240 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 397 transitions. [2025-02-06 10:18:35,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.150943396226415) internal successors, (114), 54 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 397 transitions. [2025-02-06 10:18:35,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 10:18:35,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:35,241 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:35,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:18:35,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:35,442 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr121REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:35,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:35,442 INFO L85 PathProgramCache]: Analyzing trace with hash 292477487, now seen corresponding path program 1 times [2025-02-06 10:18:35,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:35,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718896872] [2025-02-06 10:18:35,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:35,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:35,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:18:35,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:18:35,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:35,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:36,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:36,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718896872] [2025-02-06 10:18:36,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718896872] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:36,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46020071] [2025-02-06 10:18:36,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:36,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:36,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:36,737 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:18:36,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:18:36,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:18:36,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:18:36,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:36,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:36,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-02-06 10:18:36,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:36,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:18:36,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:18:37,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:18:37,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-02-06 10:18:37,119 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:18:37,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:18:37,196 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:18:37,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 10:18:37,274 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 19 treesize of output 1 [2025-02-06 10:18:37,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:18:37,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:18:37,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 [2025-02-06 10:18:37,503 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 15 treesize of output 1 [2025-02-06 10:18:37,510 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 15 treesize of output 1 [2025-02-06 10:18:37,605 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 97 treesize of output 65 [2025-02-06 10:18:37,609 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 72 [2025-02-06 10:18:37,730 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 97 treesize of output 65 [2025-02-06 10:18:37,733 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 72 [2025-02-06 10:18:37,831 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 78 treesize of output 22 [2025-02-06 10:18:37,842 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 17 treesize of output 3 [2025-02-06 10:18:37,905 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2025-02-06 10:18:37,908 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2025-02-06 10:18:37,962 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 26 treesize of output 14 [2025-02-06 10:18:37,967 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 7 treesize of output 3 [2025-02-06 10:18:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:38,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:42,441 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~data~0#1.base|) .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 8)) (.cse4 (+ |c_#StackHeapBarrier| 1))) (and (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (forall ((v_ArrVal_1296 Int)) (let ((.cse0 (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1296))) (or (< (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|) .cse1) (< (+ 3 .cse2) (select .cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~data~0#1.base|) .cse3)))))) (< |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse4))) (or (< 0 (+ .cse2 1)) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1296 Int)) (or (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1296) |c_ULTIMATE.start_main_~data~0#1.base|) .cse1) (< |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse4))))))) is different from false [2025-02-06 10:18:46,517 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~item~0#1.base|) .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 8))) (and (or (< 0 (+ .cse0 1)) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1296 Int)) (or (< |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse1) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1296) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (< |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse1) (forall ((v_ArrVal_1296 Int)) (let ((.cse3 (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1296))) (or (< (+ 3 .cse0) (select .cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse4))) (< (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) .cse2))))))))) is different from false [2025-02-06 10:18:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-06 10:18:47,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46020071] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:47,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:47,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 41 [2025-02-06 10:18:47,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601384271] [2025-02-06 10:18:47,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:47,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-06 10:18:47,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:47,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-06 10:18:47,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1453, Unknown=2, NotChecked=154, Total=1722 [2025-02-06 10:18:47,315 INFO L87 Difference]: Start difference. First operand 335 states and 397 transitions. Second operand has 42 states, 41 states have (on average 3.024390243902439) internal successors, (124), 42 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:49,919 INFO L93 Difference]: Finished difference Result 359 states and 424 transitions. [2025-02-06 10:18:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:18:49,919 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.024390243902439) internal successors, (124), 42 states have internal predecessors, (124), 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 45 [2025-02-06 10:18:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:49,921 INFO L225 Difference]: With dead ends: 359 [2025-02-06 10:18:49,921 INFO L226 Difference]: Without dead ends: 359 [2025-02-06 10:18:49,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=371, Invalid=2827, Unknown=2, NotChecked=222, Total=3422 [2025-02-06 10:18:49,922 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 485 mSDsluCounter, 3151 mSDsCounter, 0 mSdLazyCounter, 3406 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 3373 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 407 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:49,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 3373 Invalid, 3837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3406 Invalid, 0 Unknown, 407 Unchecked, 1.8s Time] [2025-02-06 10:18:49,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-02-06 10:18:49,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 334. [2025-02-06 10:18:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 265 states have (on average 1.4943396226415093) internal successors, (396), 333 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:49,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 396 transitions. [2025-02-06 10:18:49,927 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 396 transitions. Word has length 45 [2025-02-06 10:18:49,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:49,927 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 396 transitions. [2025-02-06 10:18:49,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.024390243902439) internal successors, (124), 42 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 396 transitions. [2025-02-06 10:18:49,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 10:18:49,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:49,928 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:49,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:18:50,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:50,129 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:50,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:50,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2065302754, now seen corresponding path program 1 times [2025-02-06 10:18:50,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:50,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989383078] [2025-02-06 10:18:50,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:50,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:50,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 10:18:50,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 10:18:50,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:50,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:18:50,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:50,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989383078] [2025-02-06 10:18:50,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989383078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:50,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:50,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:18:50,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337026678] [2025-02-06 10:18:50,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:50,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:18:50,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:50,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:18:50,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:18:50,228 INFO L87 Difference]: Start difference. First operand 334 states and 396 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:50,487 INFO L93 Difference]: Finished difference Result 338 states and 401 transitions. [2025-02-06 10:18:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:18:50,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 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 47 [2025-02-06 10:18:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:50,490 INFO L225 Difference]: With dead ends: 338 [2025-02-06 10:18:50,490 INFO L226 Difference]: Without dead ends: 338 [2025-02-06 10:18:50,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:18:50,490 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 64 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:50,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 528 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:18:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-02-06 10:18:50,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-02-06 10:18:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 269 states have (on average 1.4907063197026023) internal successors, (401), 337 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 401 transitions. [2025-02-06 10:18:50,495 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 401 transitions. Word has length 47 [2025-02-06 10:18:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:50,495 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 401 transitions. [2025-02-06 10:18:50,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 401 transitions. [2025-02-06 10:18:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 10:18:50,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:50,496 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:50,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 10:18:50,496 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:50,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2065302753, now seen corresponding path program 1 times [2025-02-06 10:18:50,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:50,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541136827] [2025-02-06 10:18:50,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:50,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:50,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 10:18:50,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 10:18:50,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:50,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:18:50,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:50,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541136827] [2025-02-06 10:18:50,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541136827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:50,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:50,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 10:18:50,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001094293] [2025-02-06 10:18:50,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:50,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:18:50,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:50,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:18:50,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:18:50,952 INFO L87 Difference]: Start difference. First operand 338 states and 401 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:51,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:51,622 INFO L93 Difference]: Finished difference Result 414 states and 464 transitions. [2025-02-06 10:18:51,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:18:51,622 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 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 47 [2025-02-06 10:18:51,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:51,623 INFO L225 Difference]: With dead ends: 414 [2025-02-06 10:18:51,623 INFO L226 Difference]: Without dead ends: 414 [2025-02-06 10:18:51,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:18:51,624 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 245 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:51,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 988 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:18:51,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-06 10:18:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 370. [2025-02-06 10:18:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 301 states have (on average 1.5348837209302326) internal successors, (462), 369 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 462 transitions. [2025-02-06 10:18:51,630 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 462 transitions. Word has length 47 [2025-02-06 10:18:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:51,630 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 462 transitions. [2025-02-06 10:18:51,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 462 transitions. [2025-02-06 10:18:51,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 10:18:51,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:51,631 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:51,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 10:18:51,631 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:51,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:51,631 INFO L85 PathProgramCache]: Analyzing trace with hash -894170745, now seen corresponding path program 1 times [2025-02-06 10:18:51,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:51,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355333760] [2025-02-06 10:18:51,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:51,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:51,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:18:51,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:18:51,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:51,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:18:52,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:52,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355333760] [2025-02-06 10:18:52,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355333760] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:52,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348592226] [2025-02-06 10:18:52,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:52,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:52,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:52,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:18:52,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:18:52,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:18:52,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:18:52,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:52,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:52,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 10:18:52,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:52,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:18:52,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:18:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:18:52,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:18:52,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348592226] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:52,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:52,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2025-02-06 10:18:52,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422738696] [2025-02-06 10:18:52,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:52,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 10:18:52,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:52,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 10:18:52,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:18:52,733 INFO L87 Difference]: Start difference. First operand 370 states and 462 transitions. Second operand has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:53,063 INFO L93 Difference]: Finished difference Result 456 states and 559 transitions. [2025-02-06 10:18:53,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:18:53,064 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 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 50 [2025-02-06 10:18:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:53,065 INFO L225 Difference]: With dead ends: 456 [2025-02-06 10:18:53,065 INFO L226 Difference]: Without dead ends: 456 [2025-02-06 10:18:53,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:18:53,065 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 80 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:53,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 2285 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:18:53,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-02-06 10:18:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 381. [2025-02-06 10:18:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 312 states have (on average 1.516025641025641) internal successors, (473), 380 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 473 transitions. [2025-02-06 10:18:53,071 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 473 transitions. Word has length 50 [2025-02-06 10:18:53,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:53,071 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 473 transitions. [2025-02-06 10:18:53,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 473 transitions. [2025-02-06 10:18:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 10:18:53,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:53,073 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:53,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:18:53,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-02-06 10:18:53,274 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:53,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:53,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2017551625, now seen corresponding path program 1 times [2025-02-06 10:18:53,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:53,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835378026] [2025-02-06 10:18:53,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:53,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:53,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 10:18:53,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 10:18:53,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:53,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:18:53,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:53,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835378026] [2025-02-06 10:18:53,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835378026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:53,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:53,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:18:53,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881093456] [2025-02-06 10:18:53,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:53,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:18:53,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:53,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:18:53,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:18:53,389 INFO L87 Difference]: Start difference. First operand 381 states and 473 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:53,604 INFO L93 Difference]: Finished difference Result 428 states and 481 transitions. [2025-02-06 10:18:53,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:18:53,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 52 [2025-02-06 10:18:53,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:53,606 INFO L225 Difference]: With dead ends: 428 [2025-02-06 10:18:53,606 INFO L226 Difference]: Without dead ends: 428 [2025-02-06 10:18:53,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:18:53,606 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 230 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:53,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1391 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:18:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-02-06 10:18:53,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 381. [2025-02-06 10:18:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 312 states have (on average 1.5128205128205128) internal successors, (472), 380 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 472 transitions. [2025-02-06 10:18:53,613 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 472 transitions. Word has length 52 [2025-02-06 10:18:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:53,613 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 472 transitions. [2025-02-06 10:18:53,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:53,614 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 472 transitions. [2025-02-06 10:18:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:18:53,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:53,615 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:53,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-06 10:18:53,616 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:53,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1825394459, now seen corresponding path program 1 times [2025-02-06 10:18:53,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:53,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774303475] [2025-02-06 10:18:53,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:53,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:53,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:18:53,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:18:53,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:53,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:18:53,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:53,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774303475] [2025-02-06 10:18:53,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774303475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:53,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:53,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:18:53,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516494378] [2025-02-06 10:18:53,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:53,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:18:53,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:53,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:18:53,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:18:53,826 INFO L87 Difference]: Start difference. First operand 381 states and 472 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:54,117 INFO L93 Difference]: Finished difference Result 446 states and 501 transitions. [2025-02-06 10:18:54,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:18:54,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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 54 [2025-02-06 10:18:54,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:54,119 INFO L225 Difference]: With dead ends: 446 [2025-02-06 10:18:54,119 INFO L226 Difference]: Without dead ends: 446 [2025-02-06 10:18:54,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:18:54,120 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 280 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:54,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1717 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:18:54,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-02-06 10:18:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 381. [2025-02-06 10:18:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 312 states have (on average 1.5096153846153846) internal successors, (471), 380 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 471 transitions. [2025-02-06 10:18:54,126 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 471 transitions. Word has length 54 [2025-02-06 10:18:54,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:54,127 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 471 transitions. [2025-02-06 10:18:54,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:54,127 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 471 transitions. [2025-02-06 10:18:54,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:18:54,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:54,129 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:54,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-06 10:18:54,129 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:54,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:54,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1824279285, now seen corresponding path program 1 times [2025-02-06 10:18:54,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:54,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617585287] [2025-02-06 10:18:54,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:54,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:54,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:18:54,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:18:54,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:54,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:18:54,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:54,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617585287] [2025-02-06 10:18:54,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617585287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:54,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:54,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-06 10:18:54,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319950306] [2025-02-06 10:18:54,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:54,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 10:18:54,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:54,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 10:18:54,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:18:54,841 INFO L87 Difference]: Start difference. First operand 381 states and 471 transitions. Second operand has 19 states, 18 states have (on average 3.0) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:55,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:55,889 INFO L93 Difference]: Finished difference Result 423 states and 514 transitions. [2025-02-06 10:18:55,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:18:55,889 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0) internal successors, (54), 19 states have internal predecessors, (54), 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 54 [2025-02-06 10:18:55,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:55,890 INFO L225 Difference]: With dead ends: 423 [2025-02-06 10:18:55,890 INFO L226 Difference]: Without dead ends: 423 [2025-02-06 10:18:55,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2025-02-06 10:18:55,891 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 160 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 1963 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:55,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 2193 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1963 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 10:18:55,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-02-06 10:18:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 381. [2025-02-06 10:18:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 312 states have (on average 1.5064102564102564) internal successors, (470), 380 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 470 transitions. [2025-02-06 10:18:55,896 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 470 transitions. Word has length 54 [2025-02-06 10:18:55,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:55,896 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 470 transitions. [2025-02-06 10:18:55,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 470 transitions. [2025-02-06 10:18:55,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:18:55,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:55,897 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:55,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-06 10:18:55,897 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:55,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:55,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1824279284, now seen corresponding path program 1 times [2025-02-06 10:18:55,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:55,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599117940] [2025-02-06 10:18:55,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:55,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:55,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:18:55,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:18:55,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:55,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:18:56,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:56,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599117940] [2025-02-06 10:18:56,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599117940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:56,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:56,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 10:18:56,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495826137] [2025-02-06 10:18:56,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:56,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 10:18:56,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:56,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 10:18:56,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:18:56,708 INFO L87 Difference]: Start difference. First operand 381 states and 470 transitions. Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:57,822 INFO L93 Difference]: Finished difference Result 439 states and 516 transitions. [2025-02-06 10:18:57,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:18:57,823 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 states have internal predecessors, (54), 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 54 [2025-02-06 10:18:57,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:57,824 INFO L225 Difference]: With dead ends: 439 [2025-02-06 10:18:57,824 INFO L226 Difference]: Without dead ends: 439 [2025-02-06 10:18:57,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2025-02-06 10:18:57,824 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 177 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 1799 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:57,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1711 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1799 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 10:18:57,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-02-06 10:18:57,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 381. [2025-02-06 10:18:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 312 states have (on average 1.5032051282051282) internal successors, (469), 380 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:57,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 469 transitions. [2025-02-06 10:18:57,829 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 469 transitions. Word has length 54 [2025-02-06 10:18:57,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:57,829 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 469 transitions. [2025-02-06 10:18:57,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 469 transitions. [2025-02-06 10:18:57,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:18:57,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:57,830 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:57,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-06 10:18:57,831 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-02-06 10:18:57,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:57,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1432394692, now seen corresponding path program 1 times [2025-02-06 10:18:57,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:57,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290542159] [2025-02-06 10:18:57,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:57,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:57,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:18:57,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:18:57,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:57,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:59,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:59,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290542159] [2025-02-06 10:18:59,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290542159] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:59,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738656014] [2025-02-06 10:18:59,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:59,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:59,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:59,695 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:18:59,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:18:59,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:18:59,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:19:00,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:00,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:00,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-02-06 10:19:00,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:00,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:19:00,063 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:19:00,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-06 10:19:00,107 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 15 treesize of output 1 [2025-02-06 10:19:00,112 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 25 treesize of output 13 [2025-02-06 10:19:00,181 INFO L349 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2025-02-06 10:19:00,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2025-02-06 10:19:00,244 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 26 treesize of output 19 [2025-02-06 10:19:00,265 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 26 treesize of output 19 [2025-02-06 10:19:00,308 INFO L349 Elim1Store]: treesize reduction 84, result has 30.0 percent of original size [2025-02-06 10:19:00,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 48 [2025-02-06 10:19:00,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2025-02-06 10:19:00,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 53 [2025-02-06 10:19:00,508 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 19 treesize of output 1 [2025-02-06 10:19:00,701 INFO L349 Elim1Store]: treesize reduction 126, result has 22.2 percent of original size [2025-02-06 10:19:00,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 50 [2025-02-06 10:19:00,796 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 11 treesize of output 7 [2025-02-06 10:19:00,812 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 11 treesize of output 7 [2025-02-06 10:19:01,020 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 234 treesize of output 177 [2025-02-06 10:19:01,023 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 189 [2025-02-06 10:19:01,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 174 [2025-02-06 10:19:01,487 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 183 [2025-02-06 10:19:01,913 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 35 treesize of output 7 [2025-02-06 10:19:02,045 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 173 [2025-02-06 10:19:02,051 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 120 [2025-02-06 10:19:02,386 INFO L349 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2025-02-06 10:19:02,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 55 [2025-02-06 10:19:02,490 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 27 treesize of output 11 [2025-02-06 10:19:02,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2025-02-06 10:19:02,802 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 7 treesize of output 3 [2025-02-06 10:19:02,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:02,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 66 treesize of output 30 [2025-02-06 10:19:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:03,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:05,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:05,767 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 56 [2025-02-06 10:19:05,772 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:05,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:05,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 124 treesize of output 124 [2025-02-06 10:19:05,792 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 54 treesize of output 52 [2025-02-06 10:19:05,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:05,811 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 28 treesize of output 32 [2025-02-06 10:19:05,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:05,878 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 290 treesize of output 290 [2025-02-06 10:19:07,192 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:07,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738656014] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:07,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:07,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 27] total 77 [2025-02-06 10:19:07,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32176078] [2025-02-06 10:19:07,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:07,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-02-06 10:19:07,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:07,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-02-06 10:19:07,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=5692, Unknown=3, NotChecked=0, Total=6006 [2025-02-06 10:19:07,209 INFO L87 Difference]: Start difference. First operand 381 states and 469 transitions. Second operand has 78 states, 77 states have (on average 1.974025974025974) internal successors, (152), 78 states have internal predecessors, (152), 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)