./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0521.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:49:55,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:49:56,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:49:56,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:49:56,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:49:56,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:49:56,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:49:56,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:49:56,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:49:56,036 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:49:56,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:49:56,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:49:56,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:49:56,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:49:56,037 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:49:56,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:49:56,037 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:49:56,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:49:56,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:49:56,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:49:56,038 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:49:56,038 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:49:56,038 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:49:56,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:49:56,038 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:49:56,038 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:49:56,038 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:49:56,038 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:49:56,038 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:49:56,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:49:56,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:49:56,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:49:56,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:49:56,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:49:56,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:49:56,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:49:56,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:49:56,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:49:56,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:49:56,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:49:56,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:49:56,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:49:56,039 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 [2025-03-08 22:49:56,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:49:56,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:49:56,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:49:56,244 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:49:56,244 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:49:56,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0521.i [2025-03-08 22:49:57,345 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df80cec50/38d8cb5622cb4bd69e92cb5da0722f12/FLAG8d2855ef1 [2025-03-08 22:49:57,590 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:49:57,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i [2025-03-08 22:49:57,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df80cec50/38d8cb5622cb4bd69e92cb5da0722f12/FLAG8d2855ef1 [2025-03-08 22:49:57,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df80cec50/38d8cb5622cb4bd69e92cb5da0722f12 [2025-03-08 22:49:57,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:49:57,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:49:57,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:49:57,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:49:57,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:49:57,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:49:57" (1/1) ... [2025-03-08 22:49:57,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f9e8be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:57, skipping insertion in model container [2025-03-08 22:49:57,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:49:57" (1/1) ... [2025-03-08 22:49:57,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:49:58,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:49:58,191 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:49:58,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:49:58,250 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:49:58,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58 WrapperNode [2025-03-08 22:49:58,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:49:58,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:49:58,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:49:58,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:49:58,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,291 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 295 [2025-03-08 22:49:58,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:49:58,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:49:58,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:49:58,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:49:58,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,333 INFO L175 MemorySlicer]: Split 76 memory accesses to 6 slices as follows [2, 8, 3, 16, 31, 16]. 41 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 2, 1, 0, 0, 0]. The 26 writes are split as follows [0, 1, 1, 8, 8, 8]. [2025-03-08 22:49:58,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,347 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:49:58,358 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:49:58,358 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:49:58,358 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:49:58,360 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:49:58,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:58,382 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:49:58,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:49:58,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 22:49:58,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 22:49:58,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 22:49:58,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 22:49:58,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:49:58,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:49:58,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:49:58,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 22:49:58,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 22:49:58,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 22:49:58,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:49:58,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:49:58,525 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:49:58,526 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:49:59,032 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2025-03-08 22:49:59,032 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:49:59,042 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:49:59,044 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:49:59,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:49:59 BoogieIcfgContainer [2025-03-08 22:49:59,045 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:49:59,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:49:59,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:49:59,050 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:49:59,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:49:57" (1/3) ... [2025-03-08 22:49:59,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5244b551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:49:59, skipping insertion in model container [2025-03-08 22:49:59,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (2/3) ... [2025-03-08 22:49:59,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5244b551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:49:59, skipping insertion in model container [2025-03-08 22:49:59,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:49:59" (3/3) ... [2025-03-08 22:49:59,053 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0521.i [2025-03-08 22:49:59,064 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:49:59,066 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0521.i that has 1 procedures, 309 locations, 1 initial locations, 8 loop locations, and 152 error locations. [2025-03-08 22:49:59,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:49:59,104 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;@737a45d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:49:59,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2025-03-08 22:49:59,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 156 states have (on average 2.1858974358974357) internal successors, (341), 308 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:49:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:49:59,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:59,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:49:59,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-08 22:49:59,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:59,118 INFO L85 PathProgramCache]: Analyzing trace with hash 360694713, now seen corresponding path program 1 times [2025-03-08 22:49:59,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:59,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74090404] [2025-03-08 22:49:59,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:59,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:59,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:49:59,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:49:59,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:59,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:49:59,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:59,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74090404] [2025-03-08 22:49:59,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74090404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:59,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:59,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:49:59,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176956332] [2025-03-08 22:49:59,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:59,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:49:59,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:59,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:49:59,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:49:59,237 INFO L87 Difference]: Start difference. First operand has 309 states, 156 states have (on average 2.1858974358974357) internal successors, (341), 308 states have internal predecessors, (341), 0 states have call successors, (0), 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-03-08 22:49:59,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:59,256 INFO L93 Difference]: Finished difference Result 309 states and 336 transitions. [2025-03-08 22:49:59,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:49:59,258 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-03-08 22:49:59,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:59,264 INFO L225 Difference]: With dead ends: 309 [2025-03-08 22:49:59,264 INFO L226 Difference]: Without dead ends: 307 [2025-03-08 22:49:59,265 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-03-08 22:49:59,267 INFO L435 NwaCegarLoop]: 336 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, 336 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-03-08 22:49:59,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:49:59,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-08 22:49:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2025-03-08 22:49:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 155 states have (on average 2.1548387096774193) internal successors, (334), 306 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:49:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 334 transitions. [2025-03-08 22:49:59,312 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 334 transitions. Word has length 5 [2025-03-08 22:49:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:59,312 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 334 transitions. [2025-03-08 22:49:59,313 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-03-08 22:49:59,313 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 334 transitions. [2025-03-08 22:49:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:49:59,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:59,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:49:59,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:49:59,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-08 22:49:59,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:59,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1703374083, now seen corresponding path program 1 times [2025-03-08 22:49:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:59,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004442377] [2025-03-08 22:49:59,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:59,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:59,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:49:59,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:49:59,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:59,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:49:59,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:59,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004442377] [2025-03-08 22:49:59,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004442377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:59,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:59,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:49:59,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993298199] [2025-03-08 22:49:59,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:59,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:49:59,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:59,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:49:59,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:49:59,458 INFO L87 Difference]: Start difference. First operand 307 states and 334 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-03-08 22:49:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:59,687 INFO L93 Difference]: Finished difference Result 291 states and 318 transitions. [2025-03-08 22:49:59,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:49:59,687 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-03-08 22:49:59,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:59,689 INFO L225 Difference]: With dead ends: 291 [2025-03-08 22:49:59,689 INFO L226 Difference]: Without dead ends: 291 [2025-03-08 22:49:59,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:49:59,690 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 59 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:59,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 409 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:49:59,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-08 22:49:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-03-08 22:49:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 155 states have (on average 2.0516129032258066) internal successors, (318), 290 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:49:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 318 transitions. [2025-03-08 22:49:59,703 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 318 transitions. Word has length 6 [2025-03-08 22:49:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:59,704 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 318 transitions. [2025-03-08 22:49:59,704 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-03-08 22:49:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 318 transitions. [2025-03-08 22:49:59,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:49:59,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:59,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:49:59,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:49:59,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr142REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-08 22:49:59,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:59,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1703374084, now seen corresponding path program 1 times [2025-03-08 22:49:59,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:59,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047283927] [2025-03-08 22:49:59,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:59,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:59,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:49:59,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:49:59,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:59,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:49:59,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:59,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047283927] [2025-03-08 22:49:59,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047283927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:59,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:59,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:49:59,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247265913] [2025-03-08 22:49:59,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:59,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:49:59,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:59,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:49:59,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:49:59,757 INFO L87 Difference]: Start difference. First operand 291 states and 318 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-03-08 22:49:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:59,911 INFO L93 Difference]: Finished difference Result 275 states and 302 transitions. [2025-03-08 22:49:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:49:59,912 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-03-08 22:49:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:59,913 INFO L225 Difference]: With dead ends: 275 [2025-03-08 22:49:59,913 INFO L226 Difference]: Without dead ends: 275 [2025-03-08 22:49:59,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:49:59,913 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 59 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:59,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 400 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:49:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-08 22:49:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-03-08 22:49:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 155 states have (on average 1.9483870967741936) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:49:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 302 transitions. [2025-03-08 22:49:59,920 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 302 transitions. Word has length 6 [2025-03-08 22:49:59,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:59,921 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 302 transitions. [2025-03-08 22:49:59,921 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-03-08 22:49:59,921 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 302 transitions. [2025-03-08 22:49:59,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:49:59,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:59,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:49:59,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:49:59,921 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-03-08 22:49:59,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:59,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1703372516, now seen corresponding path program 1 times [2025-03-08 22:49:59,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:59,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739217520] [2025-03-08 22:49:59,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:59,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:59,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:49:59,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:49:59,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:59,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:59,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:49:59,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:59,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739217520] [2025-03-08 22:49:59,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739217520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:59,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:59,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:49:59,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618165794] [2025-03-08 22:49:59,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:59,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:49:59,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:59,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:49:59,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:49:59,961 INFO L87 Difference]: Start difference. First operand 275 states and 302 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-03-08 22:50:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:00,108 INFO L93 Difference]: Finished difference Result 273 states and 300 transitions. [2025-03-08 22:50:00,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:50:00,108 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-03-08 22:50:00,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:00,109 INFO L225 Difference]: With dead ends: 273 [2025-03-08 22:50:00,109 INFO L226 Difference]: Without dead ends: 273 [2025-03-08 22:50:00,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:50:00,110 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 6 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 443 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:00,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 443 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:50:00,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-08 22:50:00,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-03-08 22:50:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 155 states have (on average 1.935483870967742) internal successors, (300), 272 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-03-08 22:50:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 300 transitions. [2025-03-08 22:50:00,119 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 300 transitions. Word has length 6 [2025-03-08 22:50:00,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:00,119 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 300 transitions. [2025-03-08 22:50:00,119 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-03-08 22:50:00,119 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 300 transitions. [2025-03-08 22:50:00,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:50:00,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:00,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:50:00,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:50:00,121 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-03-08 22:50:00,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1703372515, now seen corresponding path program 1 times [2025-03-08 22:50:00,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:00,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558322643] [2025-03-08 22:50:00,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:00,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:00,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:50:00,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:50:00,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:00,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:00,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:00,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:00,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558322643] [2025-03-08 22:50:00,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558322643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:00,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:00,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:50:00,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830533562] [2025-03-08 22:50:00,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:00,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:50:00,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:00,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:50:00,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:50:00,183 INFO L87 Difference]: Start difference. First operand 273 states and 300 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-03-08 22:50:00,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:00,308 INFO L93 Difference]: Finished difference Result 271 states and 298 transitions. [2025-03-08 22:50:00,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:50:00,309 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-03-08 22:50:00,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:00,310 INFO L225 Difference]: With dead ends: 271 [2025-03-08 22:50:00,310 INFO L226 Difference]: Without dead ends: 271 [2025-03-08 22:50:00,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:50:00,310 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 6 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 453 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:00,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 453 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:50:00,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-08 22:50:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-03-08 22:50:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 155 states have (on average 1.9225806451612903) internal successors, (298), 270 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 298 transitions. [2025-03-08 22:50:00,317 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 298 transitions. Word has length 6 [2025-03-08 22:50:00,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:00,317 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 298 transitions. [2025-03-08 22:50:00,317 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-03-08 22:50:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 298 transitions. [2025-03-08 22:50:00,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:50:00,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:00,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:00,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:50:00,318 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-03-08 22:50:00,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:00,318 INFO L85 PathProgramCache]: Analyzing trace with hash -559945799, now seen corresponding path program 1 times [2025-03-08 22:50:00,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:00,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773124531] [2025-03-08 22:50:00,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:00,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:00,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:50:00,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:50:00,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:00,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:00,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:00,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773124531] [2025-03-08 22:50:00,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773124531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:00,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:00,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:50:00,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951088674] [2025-03-08 22:50:00,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:00,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:50:00,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:00,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:50:00,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:50:00,395 INFO L87 Difference]: Start difference. First operand 271 states and 298 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-03-08 22:50:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:00,444 INFO L93 Difference]: Finished difference Result 334 states and 369 transitions. [2025-03-08 22:50:00,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:50:00,444 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-03-08 22:50:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:00,445 INFO L225 Difference]: With dead ends: 334 [2025-03-08 22:50:00,445 INFO L226 Difference]: Without dead ends: 334 [2025-03-08 22:50:00,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:50:00,446 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 67 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 858 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:00,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 858 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:50:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-08 22:50:00,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 276. [2025-03-08 22:50:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 160 states have (on average 1.9) 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-03-08 22:50:00,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 304 transitions. [2025-03-08 22:50:00,451 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 304 transitions. Word has length 8 [2025-03-08 22:50:00,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:00,451 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 304 transitions. [2025-03-08 22:50:00,451 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-03-08 22:50:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 304 transitions. [2025-03-08 22:50:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:50:00,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:00,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:00,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:50:00,452 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-03-08 22:50:00,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:00,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2028040048, now seen corresponding path program 1 times [2025-03-08 22:50:00,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:00,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068179091] [2025-03-08 22:50:00,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:00,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:00,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:50:00,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:50:00,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:00,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:00,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:00,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:00,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068179091] [2025-03-08 22:50:00,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068179091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:00,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:00,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:50:00,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431726793] [2025-03-08 22:50:00,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:00,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:50:00,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:00,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:50:00,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:50:00,488 INFO L87 Difference]: Start difference. First operand 276 states and 304 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-03-08 22:50:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:00,621 INFO L93 Difference]: Finished difference Result 274 states and 302 transitions. [2025-03-08 22:50:00,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:50:00,621 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-03-08 22:50:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:00,622 INFO L225 Difference]: With dead ends: 274 [2025-03-08 22:50:00,622 INFO L226 Difference]: Without dead ends: 274 [2025-03-08 22:50:00,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:50:00,623 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 2 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 442 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:00,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 442 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:50:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-08 22:50:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2025-03-08 22:50:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 160 states have (on average 1.8875) internal successors, (302), 273 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 302 transitions. [2025-03-08 22:50:00,628 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 302 transitions. Word has length 11 [2025-03-08 22:50:00,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:00,628 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 302 transitions. [2025-03-08 22:50:00,629 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-03-08 22:50:00,629 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 302 transitions. [2025-03-08 22:50:00,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:50:00,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:00,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:00,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:50:00,629 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-03-08 22:50:00,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:00,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2028040047, now seen corresponding path program 1 times [2025-03-08 22:50:00,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:00,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580944536] [2025-03-08 22:50:00,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:00,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:00,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:50:00,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:50:00,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:00,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:00,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580944536] [2025-03-08 22:50:00,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580944536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:00,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:00,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:50:00,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127954040] [2025-03-08 22:50:00,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:00,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:50:00,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:00,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:50:00,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:50:00,692 INFO L87 Difference]: Start difference. First operand 274 states and 302 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-03-08 22:50:00,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:00,809 INFO L93 Difference]: Finished difference Result 272 states and 300 transitions. [2025-03-08 22:50:00,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:50:00,810 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-03-08 22:50:00,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:00,811 INFO L225 Difference]: With dead ends: 272 [2025-03-08 22:50:00,811 INFO L226 Difference]: Without dead ends: 272 [2025-03-08 22:50:00,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:50:00,811 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 2 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 452 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-03-08 22:50:00,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 452 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:50:00,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-08 22:50:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2025-03-08 22:50:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 160 states have (on average 1.875) 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-03-08 22:50:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 300 transitions. [2025-03-08 22:50:00,815 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 300 transitions. Word has length 11 [2025-03-08 22:50:00,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:00,815 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 300 transitions. [2025-03-08 22:50:00,815 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-03-08 22:50:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 300 transitions. [2025-03-08 22:50:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 22:50:00,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:00,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:00,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:50:00,816 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-03-08 22:50:00,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:00,817 INFO L85 PathProgramCache]: Analyzing trace with hash 363746490, now seen corresponding path program 1 times [2025-03-08 22:50:00,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:00,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715253468] [2025-03-08 22:50:00,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:00,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:00,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 22:50:00,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 22:50:00,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:00,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:00,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:00,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:00,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715253468] [2025-03-08 22:50:00,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715253468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:00,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:00,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:50:00,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203420875] [2025-03-08 22:50:00,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:00,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:50:00,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:00,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:50:00,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:50:00,905 INFO L87 Difference]: Start difference. First operand 272 states and 300 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-03-08 22:50:01,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:01,006 INFO L93 Difference]: Finished difference Result 322 states and 357 transitions. [2025-03-08 22:50:01,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:50:01,006 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-03-08 22:50:01,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:01,007 INFO L225 Difference]: With dead ends: 322 [2025-03-08 22:50:01,007 INFO L226 Difference]: Without dead ends: 322 [2025-03-08 22:50:01,008 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-03-08 22:50:01,008 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 77 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1398 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-03-08 22:50:01,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1398 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:50:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-08 22:50:01,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 275. [2025-03-08 22:50:01,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 163 states have (on average 1.8588957055214723) 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-03-08 22:50:01,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 303 transitions. [2025-03-08 22:50:01,012 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 303 transitions. Word has length 13 [2025-03-08 22:50:01,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:01,012 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 303 transitions. [2025-03-08 22:50:01,012 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-03-08 22:50:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 303 transitions. [2025-03-08 22:50:01,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:50:01,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:01,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:01,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:50:01,013 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-08 22:50:01,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:01,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1643331860, now seen corresponding path program 1 times [2025-03-08 22:50:01,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:01,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790813009] [2025-03-08 22:50:01,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:01,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:01,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:50:01,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:50:01,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:01,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:01,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:01,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790813009] [2025-03-08 22:50:01,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790813009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:01,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:01,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:50:01,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563291555] [2025-03-08 22:50:01,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:01,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:50:01,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:01,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:50:01,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:50:01,080 INFO L87 Difference]: Start difference. First operand 275 states and 303 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-03-08 22:50:01,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:01,147 INFO L93 Difference]: Finished difference Result 396 states and 436 transitions. [2025-03-08 22:50:01,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:50:01,148 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-03-08 22:50:01,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:01,149 INFO L225 Difference]: With dead ends: 396 [2025-03-08 22:50:01,149 INFO L226 Difference]: Without dead ends: 396 [2025-03-08 22:50:01,149 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-03-08 22:50:01,149 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 130 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1103 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-03-08 22:50:01,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1103 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:50:01,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-08 22:50:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 336. [2025-03-08 22:50:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 224 states have (on average 1.9107142857142858) internal successors, (428), 335 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 428 transitions. [2025-03-08 22:50:01,154 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 428 transitions. Word has length 14 [2025-03-08 22:50:01,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:01,154 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 428 transitions. [2025-03-08 22:50:01,154 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-03-08 22:50:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 428 transitions. [2025-03-08 22:50:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 22:50:01,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:01,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:01,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:50:01,154 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-03-08 22:50:01,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:01,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1306076388, now seen corresponding path program 1 times [2025-03-08 22:50:01,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:01,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32537696] [2025-03-08 22:50:01,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:01,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:01,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 22:50:01,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 22:50:01,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:01,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:01,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:01,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:01,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32537696] [2025-03-08 22:50:01,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32537696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:01,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:01,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:50:01,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515144818] [2025-03-08 22:50:01,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:01,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:50:01,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:01,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:50:01,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:50:01,180 INFO L87 Difference]: Start difference. First operand 336 states and 428 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-03-08 22:50:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:01,303 INFO L93 Difference]: Finished difference Result 320 states and 396 transitions. [2025-03-08 22:50:01,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:50:01,304 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-03-08 22:50:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:01,305 INFO L225 Difference]: With dead ends: 320 [2025-03-08 22:50:01,305 INFO L226 Difference]: Without dead ends: 320 [2025-03-08 22:50:01,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:50:01,305 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 59 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 340 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:01,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 340 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:50:01,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-08 22:50:01,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2025-03-08 22:50:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 224 states have (on average 1.7678571428571428) internal successors, (396), 319 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-03-08 22:50:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 396 transitions. [2025-03-08 22:50:01,309 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 396 transitions. Word has length 16 [2025-03-08 22:50:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:01,309 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 396 transitions. [2025-03-08 22:50:01,309 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-03-08 22:50:01,309 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 396 transitions. [2025-03-08 22:50:01,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 22:50:01,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:01,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:01,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:50:01,310 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-03-08 22:50:01,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:01,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1306076389, now seen corresponding path program 1 times [2025-03-08 22:50:01,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:01,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443150760] [2025-03-08 22:50:01,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:01,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:01,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 22:50:01,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 22:50:01,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:01,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:01,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:01,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443150760] [2025-03-08 22:50:01,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443150760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:01,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:01,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:50:01,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877347135] [2025-03-08 22:50:01,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:01,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:50:01,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:01,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:50:01,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:50:01,365 INFO L87 Difference]: Start difference. First operand 320 states and 396 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-03-08 22:50:01,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:01,481 INFO L93 Difference]: Finished difference Result 304 states and 364 transitions. [2025-03-08 22:50:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:50:01,481 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-03-08 22:50:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:01,482 INFO L225 Difference]: With dead ends: 304 [2025-03-08 22:50:01,482 INFO L226 Difference]: Without dead ends: 304 [2025-03-08 22:50:01,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:50:01,483 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 59 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 349 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-03-08 22:50:01,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 349 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:50:01,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-08 22:50:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-03-08 22:50:01,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 224 states have (on average 1.625) internal successors, (364), 303 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 364 transitions. [2025-03-08 22:50:01,488 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 364 transitions. Word has length 16 [2025-03-08 22:50:01,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:01,488 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 364 transitions. [2025-03-08 22:50:01,488 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-03-08 22:50:01,488 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 364 transitions. [2025-03-08 22:50:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 22:50:01,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:01,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:01,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:50:01,490 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-03-08 22:50:01,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:01,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1806499961, now seen corresponding path program 1 times [2025-03-08 22:50:01,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:01,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325297525] [2025-03-08 22:50:01,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:01,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:01,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 22:50:01,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 22:50:01,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:01,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:01,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:01,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325297525] [2025-03-08 22:50:01,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325297525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:01,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:01,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:50:01,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139454984] [2025-03-08 22:50:01,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:01,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:50:01,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:01,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:50:01,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:50:01,518 INFO L87 Difference]: Start difference. First operand 304 states and 364 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-03-08 22:50:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:01,528 INFO L93 Difference]: Finished difference Result 289 states and 339 transitions. [2025-03-08 22:50:01,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:50:01,528 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-03-08 22:50:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:01,529 INFO L225 Difference]: With dead ends: 289 [2025-03-08 22:50:01,529 INFO L226 Difference]: Without dead ends: 289 [2025-03-08 22:50:01,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:50:01,530 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 513 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-03-08 22:50:01,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 513 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:50:01,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-08 22:50:01,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-03-08 22:50:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 209 states have (on average 1.6220095693779903) 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-03-08 22:50:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 339 transitions. [2025-03-08 22:50:01,534 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 339 transitions. Word has length 16 [2025-03-08 22:50:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:01,535 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 339 transitions. [2025-03-08 22:50:01,535 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-03-08 22:50:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 339 transitions. [2025-03-08 22:50:01,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:50:01,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:01,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:01,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:50:01,536 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-03-08 22:50:01,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:01,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1008961249, now seen corresponding path program 1 times [2025-03-08 22:50:01,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:01,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864931325] [2025-03-08 22:50:01,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:01,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:01,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:50:01,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:50:01,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:01,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:01,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:01,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:01,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864931325] [2025-03-08 22:50:01,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864931325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:01,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:01,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:50:01,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826812744] [2025-03-08 22:50:01,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:01,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:50:01,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:01,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:50:01,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:50:01,599 INFO L87 Difference]: Start difference. First operand 289 states and 339 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-03-08 22:50:01,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:01,660 INFO L93 Difference]: Finished difference Result 307 states and 342 transitions. [2025-03-08 22:50:01,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:50:01,660 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-03-08 22:50:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:01,661 INFO L225 Difference]: With dead ends: 307 [2025-03-08 22:50:01,661 INFO L226 Difference]: Without dead ends: 307 [2025-03-08 22:50:01,661 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-03-08 22:50:01,662 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 63 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 974 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:01,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 974 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:50:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-08 22:50:01,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 287. [2025-03-08 22:50:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 207 states have (on average 1.6135265700483092) internal successors, (334), 286 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 334 transitions. [2025-03-08 22:50:01,668 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 334 transitions. Word has length 18 [2025-03-08 22:50:01,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:01,668 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 334 transitions. [2025-03-08 22:50:01,668 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-03-08 22:50:01,668 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 334 transitions. [2025-03-08 22:50:01,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:50:01,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:01,669 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:01,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:50:01,670 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-03-08 22:50:01,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:01,670 INFO L85 PathProgramCache]: Analyzing trace with hash -726999257, now seen corresponding path program 1 times [2025-03-08 22:50:01,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:01,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479426436] [2025-03-08 22:50:01,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:01,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:01,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:50:01,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:50:01,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:01,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:01,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:01,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479426436] [2025-03-08 22:50:01,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479426436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:01,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:01,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:50:01,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778519893] [2025-03-08 22:50:01,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:01,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:50:01,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:01,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:50:01,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:50:01,778 INFO L87 Difference]: Start difference. First operand 287 states and 334 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-03-08 22:50:02,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:02,012 INFO L93 Difference]: Finished difference Result 308 states and 357 transitions. [2025-03-08 22:50:02,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:50:02,013 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-03-08 22:50:02,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:02,014 INFO L225 Difference]: With dead ends: 308 [2025-03-08 22:50:02,014 INFO L226 Difference]: Without dead ends: 308 [2025-03-08 22:50:02,015 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-03-08 22:50:02,015 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 82 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:02,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 597 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:50:02,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-08 22:50:02,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 289. [2025-03-08 22:50:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 211 states have (on average 1.6066350710900474) 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-03-08 22:50:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 339 transitions. [2025-03-08 22:50:02,022 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 339 transitions. Word has length 19 [2025-03-08 22:50:02,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:02,022 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 339 transitions. [2025-03-08 22:50:02,022 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-03-08 22:50:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 339 transitions. [2025-03-08 22:50:02,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:50:02,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:02,023 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:02,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:50:02,023 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-03-08 22:50:02,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:02,023 INFO L85 PathProgramCache]: Analyzing trace with hash -726999256, now seen corresponding path program 1 times [2025-03-08 22:50:02,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:02,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336739028] [2025-03-08 22:50:02,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:02,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:02,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:50:02,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:50:02,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:02,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:02,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:02,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336739028] [2025-03-08 22:50:02,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336739028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:02,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:02,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:50:02,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534634663] [2025-03-08 22:50:02,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:02,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:50:02,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:02,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:50:02,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:50:02,164 INFO L87 Difference]: Start difference. First operand 289 states and 339 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-03-08 22:50:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:02,446 INFO L93 Difference]: Finished difference Result 296 states and 346 transitions. [2025-03-08 22:50:02,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:50:02,447 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-03-08 22:50:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:02,448 INFO L225 Difference]: With dead ends: 296 [2025-03-08 22:50:02,448 INFO L226 Difference]: Without dead ends: 296 [2025-03-08 22:50:02,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:50:02,448 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 64 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 586 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:02,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 586 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:50:02,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-08 22:50:02,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 288. [2025-03-08 22:50:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 211 states have (on average 1.6018957345971565) internal successors, (338), 287 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 338 transitions. [2025-03-08 22:50:02,453 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 338 transitions. Word has length 19 [2025-03-08 22:50:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:02,454 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 338 transitions. [2025-03-08 22:50:02,454 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-03-08 22:50:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 338 transitions. [2025-03-08 22:50:02,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:50:02,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:02,454 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-03-08 22:50:02,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:50:02,454 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-03-08 22:50:02,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:02,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1032042438, now seen corresponding path program 1 times [2025-03-08 22:50:02,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:02,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92008795] [2025-03-08 22:50:02,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:02,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:02,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:50:02,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:50:02,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:02,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:02,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:02,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92008795] [2025-03-08 22:50:02,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92008795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:02,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:02,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:50:02,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771388981] [2025-03-08 22:50:02,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:02,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:50:02,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:02,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:50:02,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:50:02,556 INFO L87 Difference]: Start difference. First operand 288 states and 338 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-03-08 22:50:02,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:02,771 INFO L93 Difference]: Finished difference Result 301 states and 338 transitions. [2025-03-08 22:50:02,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:50:02,771 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-03-08 22:50:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:02,772 INFO L225 Difference]: With dead ends: 301 [2025-03-08 22:50:02,772 INFO L226 Difference]: Without dead ends: 299 [2025-03-08 22:50:02,772 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-03-08 22:50:02,773 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 49 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 636 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:02,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 636 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:50:02,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-08 22:50:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 287. [2025-03-08 22:50:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 210 states have (on average 1.6) internal successors, (336), 286 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 336 transitions. [2025-03-08 22:50:02,777 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 336 transitions. Word has length 23 [2025-03-08 22:50:02,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:02,777 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 336 transitions. [2025-03-08 22:50:02,777 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-03-08 22:50:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 336 transitions. [2025-03-08 22:50:02,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:50:02,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:02,778 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-03-08 22:50:02,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:50:02,778 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-03-08 22:50:02,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:02,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1033158476, now seen corresponding path program 1 times [2025-03-08 22:50:02,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:02,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287317946] [2025-03-08 22:50:02,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:02,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:02,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:50:02,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:50:02,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:02,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:02,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:02,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287317946] [2025-03-08 22:50:02,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287317946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:02,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:02,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:50:02,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506557829] [2025-03-08 22:50:02,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:02,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:50:02,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:02,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:50:02,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:50:02,894 INFO L87 Difference]: Start difference. First operand 287 states and 336 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-03-08 22:50:03,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:03,020 INFO L93 Difference]: Finished difference Result 303 states and 339 transitions. [2025-03-08 22:50:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:50:03,021 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-03-08 22:50:03,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:03,022 INFO L225 Difference]: With dead ends: 303 [2025-03-08 22:50:03,022 INFO L226 Difference]: Without dead ends: 303 [2025-03-08 22:50:03,022 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-03-08 22:50:03,022 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 76 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1436 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-03-08 22:50:03,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1436 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:50:03,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-08 22:50:03,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 273. [2025-03-08 22:50:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 196 states have (on average 1.596938775510204) internal successors, (313), 272 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-03-08 22:50:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 313 transitions. [2025-03-08 22:50:03,026 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 313 transitions. Word has length 23 [2025-03-08 22:50:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:03,026 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 313 transitions. [2025-03-08 22:50:03,026 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-03-08 22:50:03,027 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 313 transitions. [2025-03-08 22:50:03,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 22:50:03,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:03,027 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-03-08 22:50:03,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:50:03,027 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-03-08 22:50:03,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:03,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1902456308, now seen corresponding path program 1 times [2025-03-08 22:50:03,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:03,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799857789] [2025-03-08 22:50:03,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:03,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:03,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:50:03,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:50:03,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:03,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:03,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:03,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799857789] [2025-03-08 22:50:03,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799857789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:03,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:03,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:50:03,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190746433] [2025-03-08 22:50:03,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:03,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:50:03,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:03,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:50:03,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:50:03,082 INFO L87 Difference]: Start difference. First operand 273 states and 313 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-03-08 22:50:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:03,125 INFO L93 Difference]: Finished difference Result 281 states and 320 transitions. [2025-03-08 22:50:03,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:50:03,125 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-03-08 22:50:03,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:03,126 INFO L225 Difference]: With dead ends: 281 [2025-03-08 22:50:03,126 INFO L226 Difference]: Without dead ends: 281 [2025-03-08 22:50:03,126 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-03-08 22:50:03,127 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 66 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 971 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-03-08 22:50:03,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 971 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:50:03,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-08 22:50:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 273. [2025-03-08 22:50:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 196 states have (on average 1.5918367346938775) internal successors, (312), 272 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 312 transitions. [2025-03-08 22:50:03,130 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 312 transitions. Word has length 24 [2025-03-08 22:50:03,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:03,131 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 312 transitions. [2025-03-08 22:50:03,131 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-03-08 22:50:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 312 transitions. [2025-03-08 22:50:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:50:03,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:03,131 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-03-08 22:50:03,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:50:03,131 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-03-08 22:50:03,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:03,132 INFO L85 PathProgramCache]: Analyzing trace with hash -887376977, now seen corresponding path program 1 times [2025-03-08 22:50:03,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:03,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690042721] [2025-03-08 22:50:03,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:03,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:03,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:50:03,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:50:03,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:03,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:03,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:03,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690042721] [2025-03-08 22:50:03,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690042721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:03,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:03,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:50:03,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900442591] [2025-03-08 22:50:03,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:03,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:50:03,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:03,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:50:03,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:50:03,156 INFO L87 Difference]: Start difference. First operand 273 states and 312 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-03-08 22:50:03,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:03,165 INFO L93 Difference]: Finished difference Result 258 states and 287 transitions. [2025-03-08 22:50:03,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:50:03,165 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-03-08 22:50:03,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:03,166 INFO L225 Difference]: With dead ends: 258 [2025-03-08 22:50:03,166 INFO L226 Difference]: Without dead ends: 241 [2025-03-08 22:50:03,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:50:03,167 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 507 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-03-08 22:50:03,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 507 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:50:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-08 22:50:03,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2025-03-08 22:50:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 164 states have (on average 1.646341463414634) 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-03-08 22:50:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 270 transitions. [2025-03-08 22:50:03,170 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 270 transitions. Word has length 26 [2025-03-08 22:50:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:03,170 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 270 transitions. [2025-03-08 22:50:03,170 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-03-08 22:50:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 270 transitions. [2025-03-08 22:50:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:50:03,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:03,171 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-03-08 22:50:03,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:50:03,171 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-03-08 22:50:03,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:03,171 INFO L85 PathProgramCache]: Analyzing trace with hash 957707112, now seen corresponding path program 1 times [2025-03-08 22:50:03,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:03,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334613365] [2025-03-08 22:50:03,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:03,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:03,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:50:03,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:50:03,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:03,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:03,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:03,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334613365] [2025-03-08 22:50:03,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334613365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:03,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:03,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 22:50:03,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442623690] [2025-03-08 22:50:03,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:03,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:50:03,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:03,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:50:03,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:50:03,436 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-03-08 22:50:03,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:03,956 INFO L93 Difference]: Finished difference Result 243 states and 272 transitions. [2025-03-08 22:50:03,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:50:03,956 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-03-08 22:50:03,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:03,957 INFO L225 Difference]: With dead ends: 243 [2025-03-08 22:50:03,957 INFO L226 Difference]: Without dead ends: 243 [2025-03-08 22:50:03,957 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-03-08 22:50:03,958 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 76 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:03,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1333 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:50:03,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-08 22:50:03,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2025-03-08 22:50:03,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 164 states have (on average 1.6402439024390243) 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-03-08 22:50:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 269 transitions. [2025-03-08 22:50:03,962 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 269 transitions. Word has length 26 [2025-03-08 22:50:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:03,962 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 269 transitions. [2025-03-08 22:50:03,962 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-03-08 22:50:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 269 transitions. [2025-03-08 22:50:03,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:50:03,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:03,963 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-03-08 22:50:03,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:50:03,963 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-03-08 22:50:03,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:03,963 INFO L85 PathProgramCache]: Analyzing trace with hash 957707113, now seen corresponding path program 1 times [2025-03-08 22:50:03,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:03,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714745576] [2025-03-08 22:50:03,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:03,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:03,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:50:03,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:50:03,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:03,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:04,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:04,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714745576] [2025-03-08 22:50:04,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714745576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:04,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:04,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 22:50:04,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493262036] [2025-03-08 22:50:04,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:04,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:50:04,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:04,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:50:04,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:50:04,351 INFO L87 Difference]: Start difference. First operand 240 states and 269 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-03-08 22:50:04,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:04,921 INFO L93 Difference]: Finished difference Result 242 states and 271 transitions. [2025-03-08 22:50:04,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:50:04,922 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-03-08 22:50:04,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:04,923 INFO L225 Difference]: With dead ends: 242 [2025-03-08 22:50:04,923 INFO L226 Difference]: Without dead ends: 242 [2025-03-08 22:50:04,923 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-03-08 22:50:04,924 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 76 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:04,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1404 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:50:04,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-08 22:50:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 239. [2025-03-08 22:50:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 164 states have (on average 1.6341463414634145) internal successors, (268), 238 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-03-08 22:50:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 268 transitions. [2025-03-08 22:50:04,927 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 268 transitions. Word has length 26 [2025-03-08 22:50:04,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:04,927 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 268 transitions. [2025-03-08 22:50:04,927 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-03-08 22:50:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 268 transitions. [2025-03-08 22:50:04,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 22:50:04,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:04,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] [2025-03-08 22:50:04,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:50:04,928 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-08 22:50:04,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:04,928 INFO L85 PathProgramCache]: Analyzing trace with hash -410421762, now seen corresponding path program 1 times [2025-03-08 22:50:04,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:04,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267710240] [2025-03-08 22:50:04,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:04,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:04,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:50:04,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:50:04,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:04,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:05,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:05,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:05,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267710240] [2025-03-08 22:50:05,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267710240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:05,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:05,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:50:05,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289399233] [2025-03-08 22:50:05,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:05,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:50:05,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:05,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:50:05,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:50:05,041 INFO L87 Difference]: Start difference. First operand 239 states and 268 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-03-08 22:50:05,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:05,147 INFO L93 Difference]: Finished difference Result 257 states and 288 transitions. [2025-03-08 22:50:05,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:50:05,148 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-03-08 22:50:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:05,149 INFO L225 Difference]: With dead ends: 257 [2025-03-08 22:50:05,149 INFO L226 Difference]: Without dead ends: 257 [2025-03-08 22:50:05,149 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-03-08 22:50:05,149 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 111 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:05,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1329 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:50:05,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-08 22:50:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 239. [2025-03-08 22:50:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 164 states have (on average 1.6280487804878048) 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-03-08 22:50:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 267 transitions. [2025-03-08 22:50:05,153 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 267 transitions. Word has length 27 [2025-03-08 22:50:05,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:05,153 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 267 transitions. [2025-03-08 22:50:05,154 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-03-08 22:50:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 267 transitions. [2025-03-08 22:50:05,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 22:50:05,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:05,154 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-03-08 22:50:05,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:50:05,154 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-03-08 22:50:05,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:05,155 INFO L85 PathProgramCache]: Analyzing trace with hash 22672740, now seen corresponding path program 1 times [2025-03-08 22:50:05,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:05,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405140170] [2025-03-08 22:50:05,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:05,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:05,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 22:50:05,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 22:50:05,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:05,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:50:05,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:05,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405140170] [2025-03-08 22:50:05,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405140170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:05,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:05,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:50:05,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464725898] [2025-03-08 22:50:05,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:05,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:50:05,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:05,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:50:05,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:50:05,265 INFO L87 Difference]: Start difference. First operand 239 states and 267 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-03-08 22:50:05,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:05,426 INFO L93 Difference]: Finished difference Result 256 states and 287 transitions. [2025-03-08 22:50:05,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:50:05,426 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-03-08 22:50:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:05,427 INFO L225 Difference]: With dead ends: 256 [2025-03-08 22:50:05,427 INFO L226 Difference]: Without dead ends: 256 [2025-03-08 22:50:05,427 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-03-08 22:50:05,428 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 21 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 715 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-03-08 22:50:05,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 715 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:50:05,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-08 22:50:05,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2025-03-08 22:50:05,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 164 states have (on average 1.6219512195121952) 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-03-08 22:50:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 266 transitions. [2025-03-08 22:50:05,432 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 266 transitions. Word has length 30 [2025-03-08 22:50:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:05,432 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 266 transitions. [2025-03-08 22:50:05,432 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-03-08 22:50:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 266 transitions. [2025-03-08 22:50:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 22:50:05,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:05,432 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-03-08 22:50:05,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:50:05,432 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-03-08 22:50:05,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:05,433 INFO L85 PathProgramCache]: Analyzing trace with hash 22672741, now seen corresponding path program 1 times [2025-03-08 22:50:05,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:05,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999353597] [2025-03-08 22:50:05,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:05,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:05,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 22:50:05,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 22:50:05,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:05,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:05,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:05,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:05,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999353597] [2025-03-08 22:50:05,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999353597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:05,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:05,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:50:05,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191779331] [2025-03-08 22:50:05,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:05,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:50:05,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:05,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:50:05,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:50:05,690 INFO L87 Difference]: Start difference. First operand 238 states and 266 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-03-08 22:50:06,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:06,090 INFO L93 Difference]: Finished difference Result 263 states and 294 transitions. [2025-03-08 22:50:06,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:50:06,091 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-03-08 22:50:06,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:06,091 INFO L225 Difference]: With dead ends: 263 [2025-03-08 22:50:06,091 INFO L226 Difference]: Without dead ends: 263 [2025-03-08 22:50:06,092 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-03-08 22:50:06,092 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 99 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:06,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 842 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:50:06,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-08 22:50:06,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 237. [2025-03-08 22:50:06,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 164 states have (on average 1.6158536585365855) internal successors, (265), 236 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 265 transitions. [2025-03-08 22:50:06,095 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 265 transitions. Word has length 30 [2025-03-08 22:50:06,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:06,095 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 265 transitions. [2025-03-08 22:50:06,095 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-03-08 22:50:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 265 transitions. [2025-03-08 22:50:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 22:50:06,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:06,096 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-03-08 22:50:06,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:50:06,096 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-08 22:50:06,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:06,096 INFO L85 PathProgramCache]: Analyzing trace with hash 483858012, now seen corresponding path program 1 times [2025-03-08 22:50:06,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:06,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148448560] [2025-03-08 22:50:06,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:06,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:06,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:50:06,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:50:06,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:06,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:06,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:06,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148448560] [2025-03-08 22:50:06,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148448560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:06,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:06,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 22:50:06,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179524242] [2025-03-08 22:50:06,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:06,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:50:06,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:06,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:50:06,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:50:06,241 INFO L87 Difference]: Start difference. First operand 237 states and 265 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-03-08 22:50:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:06,443 INFO L93 Difference]: Finished difference Result 240 states and 268 transitions. [2025-03-08 22:50:06,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:50:06,443 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-03-08 22:50:06,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:06,444 INFO L225 Difference]: With dead ends: 240 [2025-03-08 22:50:06,444 INFO L226 Difference]: Without dead ends: 240 [2025-03-08 22:50:06,444 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-03-08 22:50:06,444 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 69 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 2146 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:06,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 2146 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:50:06,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-08 22:50:06,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2025-03-08 22:50:06,447 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-03-08 22:50:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 266 transitions. [2025-03-08 22:50:06,447 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 266 transitions. Word has length 33 [2025-03-08 22:50:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:06,448 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 266 transitions. [2025-03-08 22:50:06,448 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-03-08 22:50:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 266 transitions. [2025-03-08 22:50:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 22:50:06,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:06,448 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-03-08 22:50:06,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:50:06,448 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-03-08 22:50:06,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:06,449 INFO L85 PathProgramCache]: Analyzing trace with hash 793797375, now seen corresponding path program 1 times [2025-03-08 22:50:06,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:06,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950990480] [2025-03-08 22:50:06,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:06,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:06,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 22:50:06,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 22:50:06,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:06,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:06,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:06,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950990480] [2025-03-08 22:50:06,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950990480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:06,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159547261] [2025-03-08 22:50:06,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:06,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:06,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:06,851 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:50:06,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:50:06,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 22:50:06,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 22:50:06,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:06,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:06,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 22:50:06,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:07,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:50:07,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:50:07,104 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-03-08 22:50:07,108 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-03-08 22:50:07,140 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-03-08 22:50:07,143 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-03-08 22:50:07,179 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-03-08 22:50:07,183 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-03-08 22:50:07,200 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-03-08 22:50:07,234 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-03-08 22:50:07,236 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-03-08 22:50:07,243 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-03-08 22:50:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:07,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:07,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159547261] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:50:07,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:50:07,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 19 [2025-03-08 22:50:07,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572422315] [2025-03-08 22:50:07,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:07,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 22:50:07,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:07,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 22:50:07,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-03-08 22:50:07,397 INFO L87 Difference]: Start difference. First operand 238 states and 266 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-03-08 22:50:07,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:07,928 INFO L93 Difference]: Finished difference Result 316 states and 353 transitions. [2025-03-08 22:50:07,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:50:07,929 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-03-08 22:50:07,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:07,929 INFO L225 Difference]: With dead ends: 316 [2025-03-08 22:50:07,929 INFO L226 Difference]: Without dead ends: 316 [2025-03-08 22:50:07,930 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-03-08 22:50:07,930 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 92 mSDsluCounter, 3122 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:07,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 3350 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:50:07,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-08 22:50:07,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 266. [2025-03-08 22:50:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 193 states have (on average 1.5336787564766838) internal successors, (296), 265 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 296 transitions. [2025-03-08 22:50:07,934 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 296 transitions. Word has length 34 [2025-03-08 22:50:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:07,934 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 296 transitions. [2025-03-08 22:50:07,934 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-03-08 22:50:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 296 transitions. [2025-03-08 22:50:07,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 22:50:07,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:07,934 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-03-08 22:50:07,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:50:08,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 22:50:08,139 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-03-08 22:50:08,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:08,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1981465865, now seen corresponding path program 1 times [2025-03-08 22:50:08,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:08,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483206059] [2025-03-08 22:50:08,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:08,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:08,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:50:08,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:50:08,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:08,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:08,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:08,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483206059] [2025-03-08 22:50:08,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483206059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:08,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:08,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 22:50:08,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932095373] [2025-03-08 22:50:08,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:08,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:50:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:08,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:50:08,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:50:08,626 INFO L87 Difference]: Start difference. First operand 266 states and 296 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-03-08 22:50:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:09,099 INFO L93 Difference]: Finished difference Result 266 states and 294 transitions. [2025-03-08 22:50:09,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:50:09,099 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-03-08 22:50:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:09,100 INFO L225 Difference]: With dead ends: 266 [2025-03-08 22:50:09,100 INFO L226 Difference]: Without dead ends: 266 [2025-03-08 22:50:09,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-03-08 22:50:09,100 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 70 mSDsluCounter, 1953 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:09,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2181 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:50:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-08 22:50:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-08 22:50:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 193 states have (on average 1.5233160621761659) internal successors, (294), 265 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 294 transitions. [2025-03-08 22:50:09,104 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 294 transitions. Word has length 35 [2025-03-08 22:50:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:09,104 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 294 transitions. [2025-03-08 22:50:09,104 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-03-08 22:50:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 294 transitions. [2025-03-08 22:50:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 22:50:09,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:09,104 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-03-08 22:50:09,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 22:50:09,104 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-03-08 22:50:09,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:09,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1816983416, now seen corresponding path program 1 times [2025-03-08 22:50:09,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:09,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742769454] [2025-03-08 22:50:09,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:09,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:09,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 22:50:09,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 22:50:09,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:09,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:50:09,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:09,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742769454] [2025-03-08 22:50:09,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742769454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:09,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:09,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:50:09,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848275807] [2025-03-08 22:50:09,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:09,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:50:09,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:09,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:50:09,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:50:09,216 INFO L87 Difference]: Start difference. First operand 266 states and 294 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-03-08 22:50:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:09,258 INFO L93 Difference]: Finished difference Result 272 states and 300 transitions. [2025-03-08 22:50:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:50:09,258 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-03-08 22:50:09,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:09,259 INFO L225 Difference]: With dead ends: 272 [2025-03-08 22:50:09,259 INFO L226 Difference]: Without dead ends: 272 [2025-03-08 22:50:09,259 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-03-08 22:50:09,260 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 2 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 952 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-03-08 22:50:09,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 952 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:50:09,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-08 22:50:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2025-03-08 22:50:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 198 states have (on average 1.5101010101010102) internal successors, (299), 270 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-03-08 22:50:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 299 transitions. [2025-03-08 22:50:09,266 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 299 transitions. Word has length 40 [2025-03-08 22:50:09,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:09,266 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 299 transitions. [2025-03-08 22:50:09,266 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-03-08 22:50:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 299 transitions. [2025-03-08 22:50:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 22:50:09,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:09,266 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-03-08 22:50:09,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 22:50:09,267 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-08 22:50:09,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:09,267 INFO L85 PathProgramCache]: Analyzing trace with hash 458571206, now seen corresponding path program 1 times [2025-03-08 22:50:09,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:09,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551000174] [2025-03-08 22:50:09,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:09,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:09,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:50:09,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:50:09,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:09,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:50:09,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:09,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551000174] [2025-03-08 22:50:09,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551000174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:09,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:09,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:50:09,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324928274] [2025-03-08 22:50:09,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:09,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:50:09,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:09,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:50:09,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:50:09,505 INFO L87 Difference]: Start difference. First operand 271 states and 299 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-03-08 22:50:09,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:09,882 INFO L93 Difference]: Finished difference Result 357 states and 403 transitions. [2025-03-08 22:50:09,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:50:09,882 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-03-08 22:50:09,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:09,883 INFO L225 Difference]: With dead ends: 357 [2025-03-08 22:50:09,883 INFO L226 Difference]: Without dead ends: 357 [2025-03-08 22:50:09,883 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-03-08 22:50:09,884 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 129 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:09,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1201 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:50:09,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-08 22:50:09,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 336. [2025-03-08 22:50:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 263 states have (on average 1.5285171102661597) internal successors, (402), 335 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-03-08 22:50:09,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 402 transitions. [2025-03-08 22:50:09,888 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 402 transitions. Word has length 41 [2025-03-08 22:50:09,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:09,889 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 402 transitions. [2025-03-08 22:50:09,889 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-03-08 22:50:09,889 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 402 transitions. [2025-03-08 22:50:09,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 22:50:09,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:09,889 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-03-08 22:50:09,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 22:50:09,889 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-08 22:50:09,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:09,890 INFO L85 PathProgramCache]: Analyzing trace with hash 458571205, now seen corresponding path program 1 times [2025-03-08 22:50:09,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:09,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701617218] [2025-03-08 22:50:09,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:09,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:09,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:50:09,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:50:09,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:09,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:50:09,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:10,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701617218] [2025-03-08 22:50:10,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701617218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:10,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:10,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:50:10,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151318819] [2025-03-08 22:50:10,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:10,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:50:10,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:10,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:50:10,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:50:10,001 INFO L87 Difference]: Start difference. First operand 336 states and 402 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-03-08 22:50:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:10,341 INFO L93 Difference]: Finished difference Result 406 states and 483 transitions. [2025-03-08 22:50:10,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:50:10,341 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-03-08 22:50:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:10,342 INFO L225 Difference]: With dead ends: 406 [2025-03-08 22:50:10,342 INFO L226 Difference]: Without dead ends: 406 [2025-03-08 22:50:10,342 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-03-08 22:50:10,342 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 181 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:10,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 658 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:50:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-08 22:50:10,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 336. [2025-03-08 22:50:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 265 states have (on average 1.5132075471698114) internal successors, (401), 335 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-03-08 22:50:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 401 transitions. [2025-03-08 22:50:10,346 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 401 transitions. Word has length 41 [2025-03-08 22:50:10,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:10,346 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 401 transitions. [2025-03-08 22:50:10,346 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-03-08 22:50:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 401 transitions. [2025-03-08 22:50:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 22:50:10,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:10,347 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-03-08 22:50:10,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 22:50:10,347 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-03-08 22:50:10,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:10,347 INFO L85 PathProgramCache]: Analyzing trace with hash -788723525, now seen corresponding path program 1 times [2025-03-08 22:50:10,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:10,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803485756] [2025-03-08 22:50:10,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:10,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:10,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:50:10,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:50:10,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:10,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:50:10,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:10,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803485756] [2025-03-08 22:50:10,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803485756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:10,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:10,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:50:10,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205125569] [2025-03-08 22:50:10,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:10,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:50:10,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:10,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:50:10,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:50:10,429 INFO L87 Difference]: Start difference. First operand 336 states and 401 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-03-08 22:50:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:10,561 INFO L93 Difference]: Finished difference Result 415 states and 469 transitions. [2025-03-08 22:50:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:50:10,562 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-03-08 22:50:10,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:10,563 INFO L225 Difference]: With dead ends: 415 [2025-03-08 22:50:10,563 INFO L226 Difference]: Without dead ends: 415 [2025-03-08 22:50:10,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:50:10,563 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 240 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1394 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-03-08 22:50:10,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1394 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:50:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-08 22:50:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 335. [2025-03-08 22:50:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 264 states have (on average 1.503787878787879) 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-03-08 22:50:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 397 transitions. [2025-03-08 22:50:10,568 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 397 transitions. Word has length 45 [2025-03-08 22:50:10,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:10,568 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 397 transitions. [2025-03-08 22:50:10,568 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-03-08 22:50:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 397 transitions. [2025-03-08 22:50:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 22:50:10,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:10,569 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-03-08 22:50:10,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 22:50:10,569 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-03-08 22:50:10,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:10,569 INFO L85 PathProgramCache]: Analyzing trace with hash 618253549, now seen corresponding path program 2 times [2025-03-08 22:50:10,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:10,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397582006] [2025-03-08 22:50:10,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:50:10,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:10,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-08 22:50:10,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:50:10,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:50:10,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:11,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397582006] [2025-03-08 22:50:11,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397582006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:11,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987440471] [2025-03-08 22:50:11,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:50:11,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:11,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:11,533 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:50:11,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:50:11,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-08 22:50:11,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:50:11,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:50:11,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:11,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-08 22:50:11,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:11,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:50:11,748 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:50:11,748 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-03-08 22:50:11,813 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:50:11,813 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-03-08 22:50:11,876 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-03-08 22:50:11,919 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-03-08 22:50:12,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:50:12,021 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-03-08 22:50:12,066 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-03-08 22:50:12,071 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-03-08 22:50:12,177 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-03-08 22:50:12,180 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-03-08 22:50:12,439 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-03-08 22:50:12,443 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-03-08 22:50:12,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 22:50:12,545 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-03-08 22:50:12,623 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-03-08 22:50:12,684 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-03-08 22:50:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:12,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:22,737 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_57| Int) (v_ArrVal_1111 Int) (v_ArrVal_1107 Int) (|v_ULTIMATE.start_main_~item~0#1.base_19| Int) (|v_ULTIMATE.start_main_~node~0#1.base_19| Int) (v_ArrVal_1108 Int)) (let ((.cse0 (store (store (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_19| v_ArrVal_1107) |v_ULTIMATE.start_main_~item~0#1.base_19| v_ArrVal_1108) |v_ULTIMATE.start_main_~#iter~0#1.base_57| v_ArrVal_1111))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_19|) 1)) (not (= (select .cse0 |v_ULTIMATE.start_main_~node~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-03-08 22:50:26,769 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_57| Int) (v_ArrVal_1111 Int) (v_ArrVal_1107 Int) (|v_ULTIMATE.start_main_~item~0#1.base_19| Int) (|v_ULTIMATE.start_main_~node~0#1.base_19| Int) (v_ArrVal_1108 Int)) (let ((.cse0 (store (store (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_19| v_ArrVal_1107) |v_ULTIMATE.start_main_~item~0#1.base_19| v_ArrVal_1108) |v_ULTIMATE.start_main_~#iter~0#1.base_57| v_ArrVal_1111))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_19|) 1)) (not (= (select .cse0 |v_ULTIMATE.start_main_~node~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-03-08 22:50:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-08 22:50:26,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987440471] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:50:26,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:50:26,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 19] total 53 [2025-03-08 22:50:26,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957558068] [2025-03-08 22:50:26,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:26,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-08 22:50:26,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:26,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-08 22:50:26,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2477, Unknown=3, NotChecked=202, Total=2862 [2025-03-08 22:50:26,812 INFO L87 Difference]: Start difference. First operand 335 states and 397 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-03-08 22:50:30,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:30,048 INFO L93 Difference]: Finished difference Result 375 states and 444 transitions. [2025-03-08 22:50:30,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 22:50:30,048 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-03-08 22:50:30,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:30,053 INFO L225 Difference]: With dead ends: 375 [2025-03-08 22:50:30,053 INFO L226 Difference]: Without dead ends: 375 [2025-03-08 22:50:30,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=521, Invalid=4176, Unknown=3, NotChecked=270, Total=4970 [2025-03-08 22:50:30,054 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 448 mSDsluCounter, 4376 mSDsCounter, 0 mSdLazyCounter, 4679 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 4595 SdHoareTripleChecker+Invalid, 5150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 445 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:30,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 4595 Invalid, 5150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 4679 Invalid, 0 Unknown, 445 Unchecked, 2.2s Time] [2025-03-08 22:50:30,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-08 22:50:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 334. [2025-03-08 22:50:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 264 states have (on average 1.5) 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-03-08 22:50:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 396 transitions. [2025-03-08 22:50:30,057 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 396 transitions. Word has length 45 [2025-03-08 22:50:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:30,057 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 396 transitions. [2025-03-08 22:50:30,057 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-03-08 22:50:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 396 transitions. [2025-03-08 22:50:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 22:50:30,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:30,058 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-03-08 22:50:30,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:50:30,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-08 22:50:30,262 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-03-08 22:50:30,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:30,262 INFO L85 PathProgramCache]: Analyzing trace with hash 618253550, now seen corresponding path program 1 times [2025-03-08 22:50:30,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:30,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005892333] [2025-03-08 22:50:30,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:30,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:30,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:50:30,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:50:30,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:30,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:31,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:31,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005892333] [2025-03-08 22:50:31,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005892333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:31,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565312586] [2025-03-08 22:50:31,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:31,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:31,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:31,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:50:31,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:50:31,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:50:31,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:50:31,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:31,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:31,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-08 22:50:31,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:31,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:50:31,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:50:31,343 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:50:31,343 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-03-08 22:50:31,363 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 22:50:31,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 22:50:31,446 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:50:31,446 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-08 22:50:31,469 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-08 22:50:31,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-08 22:50:31,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-03-08 22:50:31,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:50:31,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2025-03-08 22:50:31,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:50:31,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 15 [2025-03-08 22:50:31,699 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-03-08 22:50:31,706 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-03-08 22:50:31,841 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 153 treesize of output 116 [2025-03-08 22:50:31,844 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 168 treesize of output 124 [2025-03-08 22:50:32,067 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 168 treesize of output 110 [2025-03-08 22:50:32,071 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 147 treesize of output 107 [2025-03-08 22:50:32,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:50:32,201 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 128 treesize of output 34 [2025-03-08 22:50:32,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2025-03-08 22:50:32,246 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 28 treesize of output 8 [2025-03-08 22:50:32,251 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-03-08 22:50:32,292 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-03-08 22:50:32,294 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-03-08 22:50:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:32,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:37,376 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:37,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565312586] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:50:37,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:50:37,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 13] total 45 [2025-03-08 22:50:37,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003139952] [2025-03-08 22:50:37,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:37,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 22:50:37,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:37,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 22:50:37,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1937, Unknown=1, NotChecked=0, Total=2070 [2025-03-08 22:50:37,378 INFO L87 Difference]: Start difference. First operand 334 states and 396 transitions. Second operand has 46 states, 45 states have (on average 2.7555555555555555) internal successors, (124), 46 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-03-08 22:50:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:40,396 INFO L93 Difference]: Finished difference Result 364 states and 429 transitions. [2025-03-08 22:50:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 22:50:40,397 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.7555555555555555) internal successors, (124), 46 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-03-08 22:50:40,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:40,398 INFO L225 Difference]: With dead ends: 364 [2025-03-08 22:50:40,398 INFO L226 Difference]: Without dead ends: 364 [2025-03-08 22:50:40,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=493, Invalid=4062, Unknown=1, NotChecked=0, Total=4556 [2025-03-08 22:50:40,399 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 528 mSDsluCounter, 3609 mSDsCounter, 0 mSdLazyCounter, 4190 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 3830 SdHoareTripleChecker+Invalid, 4218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:40,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 3830 Invalid, 4218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4190 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 22:50:40,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-08 22:50:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 333. [2025-03-08 22:50:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 264 states have (on average 1.496212121212121) internal successors, (395), 332 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 395 transitions. [2025-03-08 22:50:40,402 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 395 transitions. Word has length 45 [2025-03-08 22:50:40,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:40,402 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 395 transitions. [2025-03-08 22:50:40,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.7555555555555555) internal successors, (124), 46 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-03-08 22:50:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 395 transitions. [2025-03-08 22:50:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 22:50:40,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:40,403 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-03-08 22:50:40,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:50:40,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:40,604 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-03-08 22:50:40,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:40,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1767879229, now seen corresponding path program 1 times [2025-03-08 22:50:40,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:40,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51803496] [2025-03-08 22:50:40,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:40,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:40,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 22:50:40,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 22:50:40,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:40,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:40,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:50:40,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:40,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51803496] [2025-03-08 22:50:40,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51803496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:40,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:40,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:50:40,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948914279] [2025-03-08 22:50:40,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:40,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:50:40,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:40,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:50:40,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:50:40,675 INFO L87 Difference]: Start difference. First operand 333 states and 395 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-03-08 22:50:40,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:40,858 INFO L93 Difference]: Finished difference Result 337 states and 400 transitions. [2025-03-08 22:50:40,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:50:40,858 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-03-08 22:50:40,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:40,859 INFO L225 Difference]: With dead ends: 337 [2025-03-08 22:50:40,859 INFO L226 Difference]: Without dead ends: 337 [2025-03-08 22:50:40,859 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-03-08 22:50:40,860 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 63 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:40,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 405 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:50:40,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-08 22:50:40,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-03-08 22:50:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 268 states have (on average 1.492537313432836) internal successors, (400), 336 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 400 transitions. [2025-03-08 22:50:40,864 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 400 transitions. Word has length 47 [2025-03-08 22:50:40,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:40,864 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 400 transitions. [2025-03-08 22:50:40,864 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-03-08 22:50:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 400 transitions. [2025-03-08 22:50:40,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 22:50:40,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:40,864 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-03-08 22:50:40,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 22:50:40,864 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-03-08 22:50:40,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:40,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1767879230, now seen corresponding path program 1 times [2025-03-08 22:50:40,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:40,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898035735] [2025-03-08 22:50:40,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:40,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:40,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 22:50:40,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 22:50:40,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:40,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:50:41,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:41,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898035735] [2025-03-08 22:50:41,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898035735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:41,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:41,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 22:50:41,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682840766] [2025-03-08 22:50:41,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:41,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:50:41,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:41,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:50:41,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:50:41,200 INFO L87 Difference]: Start difference. First operand 337 states and 400 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-03-08 22:50:41,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:41,790 INFO L93 Difference]: Finished difference Result 412 states and 462 transitions. [2025-03-08 22:50:41,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:50:41,790 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-03-08 22:50:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:41,791 INFO L225 Difference]: With dead ends: 412 [2025-03-08 22:50:41,791 INFO L226 Difference]: Without dead ends: 412 [2025-03-08 22:50:41,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:50:41,791 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 179 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:41,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1179 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:50:41,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-08 22:50:41,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 368. [2025-03-08 22:50:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 299 states have (on average 1.5384615384615385) internal successors, (460), 367 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 460 transitions. [2025-03-08 22:50:41,795 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 460 transitions. Word has length 47 [2025-03-08 22:50:41,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:41,795 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 460 transitions. [2025-03-08 22:50:41,795 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-03-08 22:50:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 460 transitions. [2025-03-08 22:50:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 22:50:41,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:41,795 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-03-08 22:50:41,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 22:50:41,795 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-03-08 22:50:41,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:41,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2077268377, now seen corresponding path program 1 times [2025-03-08 22:50:41,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:41,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423950629] [2025-03-08 22:50:41,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:41,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:41,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:50:41,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:50:41,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:41,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:50:42,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:42,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423950629] [2025-03-08 22:50:42,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423950629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:42,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483923199] [2025-03-08 22:50:42,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:42,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:42,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:42,078 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:50:42,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:50:42,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:50:42,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:50:42,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:42,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:42,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 22:50:42,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:42,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:50:42,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:50:42,303 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-03-08 22:50:42,337 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-03-08 22:50:42,371 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-03-08 22:50:42,385 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-03-08 22:50:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:50:42,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:42,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:50:42,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483923199] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:50:42,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:50:42,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 20 [2025-03-08 22:50:42,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974471526] [2025-03-08 22:50:42,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:42,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:50:42,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:42,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:50:42,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:50:42,609 INFO L87 Difference]: Start difference. First operand 368 states and 460 transitions. Second operand has 20 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:43,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:43,022 INFO L93 Difference]: Finished difference Result 454 states and 557 transitions. [2025-03-08 22:50:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:50:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 0 states have call successors, (0), 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-03-08 22:50:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:43,023 INFO L225 Difference]: With dead ends: 454 [2025-03-08 22:50:43,023 INFO L226 Difference]: Without dead ends: 454 [2025-03-08 22:50:43,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2025-03-08 22:50:43,024 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 83 mSDsluCounter, 2931 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 3145 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:43,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 3145 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:50:43,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-08 22:50:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 379. [2025-03-08 22:50:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 310 states have (on average 1.5193548387096774) internal successors, (471), 378 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-03-08 22:50:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 471 transitions. [2025-03-08 22:50:43,027 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 471 transitions. Word has length 50 [2025-03-08 22:50:43,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:43,027 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 471 transitions. [2025-03-08 22:50:43,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:43,027 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 471 transitions. [2025-03-08 22:50:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 22:50:43,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:43,028 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-03-08 22:50:43,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:50:43,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-08 22:50:43,228 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-03-08 22:50:43,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:43,228 INFO L85 PathProgramCache]: Analyzing trace with hash -215463606, now seen corresponding path program 1 times [2025-03-08 22:50:43,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:43,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222703072] [2025-03-08 22:50:43,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:43,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:43,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:50:43,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:50:43,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:43,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:50:43,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:43,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222703072] [2025-03-08 22:50:43,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222703072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:43,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:43,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:50:43,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661978015] [2025-03-08 22:50:43,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:43,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:50:43,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:43,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:50:43,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:50:43,308 INFO L87 Difference]: Start difference. First operand 379 states and 471 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-03-08 22:50:43,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:43,447 INFO L93 Difference]: Finished difference Result 426 states and 479 transitions. [2025-03-08 22:50:43,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:50:43,448 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-03-08 22:50:43,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:43,449 INFO L225 Difference]: With dead ends: 426 [2025-03-08 22:50:43,449 INFO L226 Difference]: Without dead ends: 426 [2025-03-08 22:50:43,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:50:43,450 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 229 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1384 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:43,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1384 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:50:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-08 22:50:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 379. [2025-03-08 22:50:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 310 states have (on average 1.5161290322580645) internal successors, (470), 378 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-03-08 22:50:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 470 transitions. [2025-03-08 22:50:43,453 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 470 transitions. Word has length 52 [2025-03-08 22:50:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:43,453 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 470 transitions. [2025-03-08 22:50:43,453 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-03-08 22:50:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 470 transitions. [2025-03-08 22:50:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 22:50:43,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:43,455 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-03-08 22:50:43,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 22:50:43,455 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-03-08 22:50:43,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:43,456 INFO L85 PathProgramCache]: Analyzing trace with hash -269383450, now seen corresponding path program 1 times [2025-03-08 22:50:43,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:43,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663239578] [2025-03-08 22:50:43,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:43,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:43,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:50:43,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:50:43,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:43,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:50:43,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:43,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663239578] [2025-03-08 22:50:43,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663239578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:43,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:43,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:50:43,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218240196] [2025-03-08 22:50:43,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:43,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:50:43,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:43,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:50:43,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:50:43,577 INFO L87 Difference]: Start difference. First operand 379 states and 470 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-03-08 22:50:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:43,771 INFO L93 Difference]: Finished difference Result 444 states and 499 transitions. [2025-03-08 22:50:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:50:43,772 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-03-08 22:50:43,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:43,773 INFO L225 Difference]: With dead ends: 444 [2025-03-08 22:50:43,773 INFO L226 Difference]: Without dead ends: 444 [2025-03-08 22:50:43,773 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-03-08 22:50:43,773 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 279 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1708 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-03-08 22:50:43,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1708 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:50:43,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-08 22:50:43,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 379. [2025-03-08 22:50:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 310 states have (on average 1.5129032258064516) internal successors, (469), 378 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-03-08 22:50:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 469 transitions. [2025-03-08 22:50:43,776 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 469 transitions. Word has length 54 [2025-03-08 22:50:43,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:43,776 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 469 transitions. [2025-03-08 22:50:43,776 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-03-08 22:50:43,776 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 469 transitions. [2025-03-08 22:50:43,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 22:50:43,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:43,777 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-03-08 22:50:43,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 22:50:43,777 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-03-08 22:50:43,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:43,777 INFO L85 PathProgramCache]: Analyzing trace with hash -268268276, now seen corresponding path program 1 times [2025-03-08 22:50:43,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:43,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979272755] [2025-03-08 22:50:43,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:43,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:43,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:50:43,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:50:43,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:43,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:50:44,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:44,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979272755] [2025-03-08 22:50:44,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979272755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:44,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:44,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 22:50:44,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361444648] [2025-03-08 22:50:44,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:44,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 22:50:44,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:44,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 22:50:44,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2025-03-08 22:50:44,199 INFO L87 Difference]: Start difference. First operand 379 states and 469 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-03-08 22:50:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:45,030 INFO L93 Difference]: Finished difference Result 420 states and 511 transitions. [2025-03-08 22:50:45,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 22:50:45,030 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-03-08 22:50:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:45,031 INFO L225 Difference]: With dead ends: 420 [2025-03-08 22:50:45,031 INFO L226 Difference]: Without dead ends: 420 [2025-03-08 22:50:45,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2025-03-08 22:50:45,032 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 151 mSDsluCounter, 2005 mSDsCounter, 0 mSdLazyCounter, 1961 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:45,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 2167 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1961 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 22:50:45,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-08 22:50:45,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 379. [2025-03-08 22:50:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 310 states have (on average 1.5096774193548388) internal successors, (468), 378 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:45,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 468 transitions. [2025-03-08 22:50:45,035 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 468 transitions. Word has length 54 [2025-03-08 22:50:45,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:45,035 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 468 transitions. [2025-03-08 22:50:45,035 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-03-08 22:50:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 468 transitions. [2025-03-08 22:50:45,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 22:50:45,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:45,036 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-03-08 22:50:45,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 22:50:45,036 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-03-08 22:50:45,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:45,040 INFO L85 PathProgramCache]: Analyzing trace with hash -268268275, now seen corresponding path program 1 times [2025-03-08 22:50:45,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:45,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84759146] [2025-03-08 22:50:45,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:45,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:45,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:50:45,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:50:45,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:45,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:50:45,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:45,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84759146] [2025-03-08 22:50:45,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84759146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:45,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:45,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 22:50:45,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182371856] [2025-03-08 22:50:45,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:45,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 22:50:45,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:45,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 22:50:45,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:50:45,642 INFO L87 Difference]: Start difference. First operand 379 states and 468 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-03-08 22:50:46,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:46,555 INFO L93 Difference]: Finished difference Result 436 states and 513 transitions. [2025-03-08 22:50:46,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 22:50:46,555 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-03-08 22:50:46,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:46,556 INFO L225 Difference]: With dead ends: 436 [2025-03-08 22:50:46,556 INFO L226 Difference]: Without dead ends: 436 [2025-03-08 22:50:46,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2025-03-08 22:50:46,556 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 180 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 1799 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1725 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.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:46,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1725 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1799 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 22:50:46,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-08 22:50:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 379. [2025-03-08 22:50:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 310 states have (on average 1.5064516129032257) internal successors, (467), 378 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:50:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 467 transitions. [2025-03-08 22:50:46,560 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 467 transitions. Word has length 54 [2025-03-08 22:50:46,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:46,560 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 467 transitions. [2025-03-08 22:50:46,560 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-03-08 22:50:46,560 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 467 transitions. [2025-03-08 22:50:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 22:50:46,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:46,561 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-03-08 22:50:46,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 22:50:46,561 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-03-08 22:50:46,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:46,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1264638172, now seen corresponding path program 1 times [2025-03-08 22:50:46,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:46,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080023977] [2025-03-08 22:50:46,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:46,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:46,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:50:46,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:50:46,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:46,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:48,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:48,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080023977] [2025-03-08 22:50:48,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080023977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:48,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946257494] [2025-03-08 22:50:48,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:48,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:48,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:48,033 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:50:48,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:50:48,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:50:48,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:50:48,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:48,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:48,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-03-08 22:50:48,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:48,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:50:48,237 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:50:48,237 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-03-08 22:50:48,269 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-03-08 22:50:48,276 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-03-08 22:50:48,332 INFO L349 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2025-03-08 22:50:48,332 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-03-08 22:50:48,384 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-03-08 22:50:48,403 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-03-08 22:50:48,448 INFO L349 Elim1Store]: treesize reduction 84, result has 30.0 percent of original size [2025-03-08 22:50:48,448 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-03-08 22:50:48,528 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-03-08 22:50:48,582 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-03-08 22:50:48,586 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-03-08 22:50:48,759 INFO L349 Elim1Store]: treesize reduction 126, result has 22.2 percent of original size [2025-03-08 22:50:48,760 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-03-08 22:50:48,827 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-03-08 22:50:48,839 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-03-08 22:50:49,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 243 treesize of output 182 [2025-03-08 22:50:49,048 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 249 treesize of output 189 [2025-03-08 22:50:49,441 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 267 treesize of output 179 [2025-03-08 22:50:49,445 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 243 treesize of output 183 [2025-03-08 22:50:49,726 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-03-08 22:50:49,860 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-03-08 22:50:49,864 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-03-08 22:50:50,116 INFO L349 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2025-03-08 22:50:50,116 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-03-08 22:50:50,209 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-03-08 22:50:50,220 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-03-08 22:50:50,450 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-03-08 22:50:50,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:50:50,570 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-03-08 22:50:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:50,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:53,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:50:53,757 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-03-08 22:50:53,764 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:50:53,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:50:53,774 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-03-08 22:50:53,798 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-03-08 22:50:53,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:50:53,862 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-03-08 22:50:53,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:50:53,907 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-03-08 22:50:55,400 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:50:55,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946257494] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:50:55,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:50:55,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 76 [2025-03-08 22:50:55,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373465236] [2025-03-08 22:50:55,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:55,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-03-08 22:50:55,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:55,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-03-08 22:50:55,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=5540, Unknown=4, NotChecked=0, Total=5852 [2025-03-08 22:50:55,406 INFO L87 Difference]: Start difference. First operand 379 states and 467 transitions. Second operand has 77 states, 76 states have (on average 2.0) internal successors, (152), 77 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) [2025-03-08 22:51:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:02,783 INFO L93 Difference]: Finished difference Result 408 states and 500 transitions. [2025-03-08 22:51:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 22:51:02,783 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 2.0) internal successors, (152), 77 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) Word has length 54 [2025-03-08 22:51:02,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:02,784 INFO L225 Difference]: With dead ends: 408 [2025-03-08 22:51:02,784 INFO L226 Difference]: Without dead ends: 408 [2025-03-08 22:51:02,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1872 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=923, Invalid=9993, Unknown=4, NotChecked=0, Total=10920 [2025-03-08 22:51:02,786 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 588 mSDsluCounter, 5318 mSDsCounter, 0 mSdLazyCounter, 6384 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 5537 SdHoareTripleChecker+Invalid, 6426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 6384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:02,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 5537 Invalid, 6426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 6384 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 22:51:02,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-08 22:51:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 384. [2025-03-08 22:51:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 315 states have (on average 1.5047619047619047) internal successors, (474), 383 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 474 transitions. [2025-03-08 22:51:02,789 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 474 transitions. Word has length 54 [2025-03-08 22:51:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:02,789 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 474 transitions. [2025-03-08 22:51:02,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 2.0) internal successors, (152), 77 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) [2025-03-08 22:51:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 474 transitions. [2025-03-08 22:51:02,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 22:51:02,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:02,790 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-03-08 22:51:02,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 22:51:02,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:02,990 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 149 more)] === [2025-03-08 22:51:02,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:02,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1264638173, now seen corresponding path program 1 times [2025-03-08 22:51:02,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:02,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564029238] [2025-03-08 22:51:02,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:02,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:03,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:51:03,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:51:03,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:03,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:05,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:05,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564029238] [2025-03-08 22:51:05,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564029238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:05,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095056865] [2025-03-08 22:51:05,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:05,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:05,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:05,420 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:51:05,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:51:05,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:51:05,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:51:05,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:05,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:05,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 130 conjuncts are in the unsatisfiable core [2025-03-08 22:51:05,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:05,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:51:05,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:51:05,687 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:51:05,687 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-03-08 22:51:05,710 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 22:51:05,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 22:51:05,786 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-03-08 22:51:05,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:51:05,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2025-03-08 22:51:05,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 23 treesize of output 11 [2025-03-08 22:51:05,934 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 22:51:05,935 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 1 case distinctions, treesize of input 18 treesize of output 21 [2025-03-08 22:51:05,970 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-03-08 22:51:05,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-03-08 22:51:06,049 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 52 treesize of output 39 [2025-03-08 22:51:06,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:51:06,086 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 16 treesize of output 11 [2025-03-08 22:51:06,093 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 52 treesize of output 39 [2025-03-08 22:51:06,125 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-08 22:51:06,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-03-08 22:51:06,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-08 22:51:06,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 34 [2025-03-08 22:51:06,254 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 19 treesize of output 18 [2025-03-08 22:51:06,328 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 22:51:06,328 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 1 case distinctions, treesize of input 34 treesize of output 25 [2025-03-08 22:51:06,336 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 22:51:06,336 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 1 case distinctions, treesize of input 98 treesize of output 53 [2025-03-08 22:51:06,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:51:06,526 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:51:06,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2025-03-08 22:51:06,621 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-03-08 22:51:06,628 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-03-08 22:51:06,827 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-03-08 22:51:06,831 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 198 treesize of output 137 [2025-03-08 22:51:07,233 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-03-08 22:51:07,236 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 222 treesize of output 134 [2025-03-08 22:51:07,601 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 222 treesize of output 146 [2025-03-08 22:51:07,650 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 23 treesize of output 3 [2025-03-08 22:51:08,181 INFO L349 Elim1Store]: treesize reduction 112, result has 46.4 percent of original size [2025-03-08 22:51:08,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 284 treesize of output 328 [2025-03-08 22:51:08,249 INFO L349 Elim1Store]: treesize reduction 104, result has 41.2 percent of original size [2025-03-08 22:51:08,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 324 treesize of output 246 [2025-03-08 22:51:09,997 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 284 treesize of output 240 [2025-03-08 22:51:10,000 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 284 treesize of output 260 [2025-03-08 22:51:10,459 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 220 treesize of output 128 [2025-03-08 22:51:10,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:10,464 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 134 treesize of output 98 [2025-03-08 22:51:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:10,604 INFO L312 TraceCheckSpWp]: Computing backward predicates...