./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:26:07,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:26:07,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-09 00:26:07,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:26:07,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:26:07,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:26:07,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:26:07,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:26:07,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:26:07,970 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:26:07,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:26:07,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:26:07,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:26:07,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:26:07,970 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:26:07,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:26:07,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:26:07,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:26:07,970 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:26:07,970 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:26:07,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:26:07,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:26:07,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:26:07,971 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 [2025-03-09 00:26:08,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:26:08,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:26:08,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:26:08,223 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:26:08,223 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:26:08,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-03-09 00:26:09,401 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d25ff6b5/e4a6c47aa86b4dac8872c3e31334da45/FLAG7d68e21e7 [2025-03-09 00:26:09,716 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:26:09,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-03-09 00:26:09,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d25ff6b5/e4a6c47aa86b4dac8872c3e31334da45/FLAG7d68e21e7 [2025-03-09 00:26:09,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d25ff6b5/e4a6c47aa86b4dac8872c3e31334da45 [2025-03-09 00:26:09,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:26:09,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:26:09,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:26:09,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:26:09,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:26:09,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:26:09" (1/1) ... [2025-03-09 00:26:09,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d3b802f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:09, skipping insertion in model container [2025-03-09 00:26:09,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:26:09" (1/1) ... [2025-03-09 00:26:10,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:26:10,365 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:10,373 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:10,375 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:10,378 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:10,380 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:10,388 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:10,389 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:10,389 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:10,394 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:10,395 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:10,406 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:10,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:26:10,432 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:26:10,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:26:10,593 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:26:10,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:10 WrapperNode [2025-03-09 00:26:10,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:26:10,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:26:10,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:26:10,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:26:10,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:10" (1/1) ... [2025-03-09 00:26:10,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:10" (1/1) ... [2025-03-09 00:26:10,680 INFO L138 Inliner]: procedures = 346, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 729 [2025-03-09 00:26:10,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:26:10,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:26:10,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:26:10,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:26:10,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:10" (1/1) ... [2025-03-09 00:26:10,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:10" (1/1) ... [2025-03-09 00:26:10,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:10" (1/1) ... [2025-03-09 00:26:10,736 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 3, 355, 12, 12, 2, 2]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 1, 355, 0, 0, 0, 0]. The 11 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 5, 2, 1, 2]. [2025-03-09 00:26:10,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:10" (1/1) ... [2025-03-09 00:26:10,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:10" (1/1) ... [2025-03-09 00:26:10,760 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:10" (1/1) ... [2025-03-09 00:26:10,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:10" (1/1) ... [2025-03-09 00:26:10,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:10" (1/1) ... [2025-03-09 00:26:10,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:10" (1/1) ... [2025-03-09 00:26:10,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:26:10,786 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:26:10,786 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:26:10,786 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:26:10,786 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:10" (1/1) ... [2025-03-09 00:26:10,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:26:10,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:10,815 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-09 00:26:10,818 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-09 00:26:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 00:26:10,835 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 00:26:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:26:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:26:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 00:26:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 00:26:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 00:26:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 00:26:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-09 00:26:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-09 00:26:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-09 00:26:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-09 00:26:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-09 00:26:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-09 00:26:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-09 00:26:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-09 00:26:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:26:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:26:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:26:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 00:26:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 00:26:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 00:26:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 00:26:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 00:26:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-09 00:26:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-09 00:26:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-09 00:26:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-09 00:26:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-09 00:26:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-09 00:26:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-09 00:26:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:26:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:26:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 00:26:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 00:26:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 00:26:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 00:26:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-09 00:26:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-09 00:26:10,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-09 00:26:10,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-09 00:26:10,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-09 00:26:10,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-09 00:26:10,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:26:10,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:26:11,134 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:26:11,137 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:26:11,757 INFO L? ?]: Removed 258 outVars from TransFormulas that were not future-live. [2025-03-09 00:26:11,757 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:26:11,772 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:26:11,774 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:26:11,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:26:11 BoogieIcfgContainer [2025-03-09 00:26:11,774 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:26:11,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:26:11,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:26:11,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:26:11,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:26:09" (1/3) ... [2025-03-09 00:26:11,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9c655a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:26:11, skipping insertion in model container [2025-03-09 00:26:11,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:10" (2/3) ... [2025-03-09 00:26:11,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9c655a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:26:11, skipping insertion in model container [2025-03-09 00:26:11,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:26:11" (3/3) ... [2025-03-09 00:26:11,782 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-2.i [2025-03-09 00:26:11,795 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:26:11,796 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG basename-2.i that has 2 procedures, 243 locations, 1 initial locations, 7 loop locations, and 96 error locations. [2025-03-09 00:26:11,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:26:11,842 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;@14601604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:26:11,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2025-03-09 00:26:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 243 states, 143 states have (on average 1.937062937062937) internal successors, (277), 239 states have internal predecessors, (277), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:11,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:26:11,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:11,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:26:11,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:11,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:11,854 INFO L85 PathProgramCache]: Analyzing trace with hash 330636, now seen corresponding path program 1 times [2025-03-09 00:26:11,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:11,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193292789] [2025-03-09 00:26:11,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:11,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:11,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:26:12,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:26:12,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:12,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:12,343 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-09 00:26:12,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:12,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193292789] [2025-03-09 00:26:12,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193292789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:12,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:12,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:12,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296720247] [2025-03-09 00:26:12,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:12,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:12,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:12,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:12,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:12,366 INFO L87 Difference]: Start difference. First operand has 243 states, 143 states have (on average 1.937062937062937) internal successors, (277), 239 states have internal predecessors, (277), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:12,591 INFO L93 Difference]: Finished difference Result 252 states and 284 transitions. [2025-03-09 00:26:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:12,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-09 00:26:12,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:12,598 INFO L225 Difference]: With dead ends: 252 [2025-03-09 00:26:12,599 INFO L226 Difference]: Without dead ends: 250 [2025-03-09 00:26:12,601 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-09 00:26:12,603 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 236 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:12,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 200 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-09 00:26:12,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 234. [2025-03-09 00:26:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 139 states have (on average 1.8776978417266188) internal successors, (261), 230 states have internal predecessors, (261), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 265 transitions. [2025-03-09 00:26:12,652 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 265 transitions. Word has length 3 [2025-03-09 00:26:12,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:12,653 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 265 transitions. [2025-03-09 00:26:12,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 265 transitions. [2025-03-09 00:26:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:26:12,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:12,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:26:12,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:26:12,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:12,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:12,654 INFO L85 PathProgramCache]: Analyzing trace with hash 330637, now seen corresponding path program 1 times [2025-03-09 00:26:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:12,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150263056] [2025-03-09 00:26:12,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:12,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:26:12,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:26:12,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:12,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:12,927 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-09 00:26:12,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:12,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150263056] [2025-03-09 00:26:12,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150263056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:12,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:12,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:12,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522467869] [2025-03-09 00:26:12,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:12,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:12,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:12,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:12,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:12,929 INFO L87 Difference]: Start difference. First operand 234 states and 265 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:13,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:13,085 INFO L93 Difference]: Finished difference Result 233 states and 264 transitions. [2025-03-09 00:26:13,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:13,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-09 00:26:13,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:13,086 INFO L225 Difference]: With dead ends: 233 [2025-03-09 00:26:13,086 INFO L226 Difference]: Without dead ends: 233 [2025-03-09 00:26:13,087 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-09 00:26:13,087 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 10 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:13,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 423 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:13,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-09 00:26:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2025-03-09 00:26:13,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 139 states have (on average 1.870503597122302) internal successors, (260), 229 states have internal predecessors, (260), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 264 transitions. [2025-03-09 00:26:13,104 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 264 transitions. Word has length 3 [2025-03-09 00:26:13,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:13,104 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 264 transitions. [2025-03-09 00:26:13,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 264 transitions. [2025-03-09 00:26:13,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:26:13,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:13,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:26:13,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:26:13,105 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:13,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:13,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1260308413, now seen corresponding path program 1 times [2025-03-09 00:26:13,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:13,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418022358] [2025-03-09 00:26:13,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:13,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:13,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:26:13,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:26:13,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:13,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:13,271 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-09 00:26:13,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:13,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418022358] [2025-03-09 00:26:13,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418022358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:13,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:13,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:26:13,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617457614] [2025-03-09 00:26:13,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:13,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:13,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:13,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:13,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:13,274 INFO L87 Difference]: Start difference. First operand 233 states and 264 transitions. Second operand has 3 states, 3 states have (on average 2.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-09 00:26:13,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:13,293 INFO L93 Difference]: Finished difference Result 236 states and 268 transitions. [2025-03-09 00:26:13,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:13,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.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-09 00:26:13,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:13,296 INFO L225 Difference]: With dead ends: 236 [2025-03-09 00:26:13,296 INFO L226 Difference]: Without dead ends: 236 [2025-03-09 00:26:13,296 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-09 00:26:13,298 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 2 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:13,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 517 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:13,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-09 00:26:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2025-03-09 00:26:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 140 states have (on average 1.8642857142857143) internal successors, (261), 230 states have internal predecessors, (261), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 265 transitions. [2025-03-09 00:26:13,312 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 265 transitions. Word has length 6 [2025-03-09 00:26:13,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:13,313 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 265 transitions. [2025-03-09 00:26:13,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.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-09 00:26:13,313 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 265 transitions. [2025-03-09 00:26:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:26:13,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:13,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:26:13,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:26:13,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:13,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1260308574, now seen corresponding path program 1 times [2025-03-09 00:26:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:13,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557221595] [2025-03-09 00:26:13,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:13,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:13,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:26:13,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:26:13,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:13,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:13,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:13,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557221595] [2025-03-09 00:26:13,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557221595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:13,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:13,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:26:13,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478476403] [2025-03-09 00:26:13,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:13,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:26:13,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:13,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:26:13,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:13,613 INFO L87 Difference]: Start difference. First operand 234 states and 265 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-09 00:26:13,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:13,802 INFO L93 Difference]: Finished difference Result 236 states and 267 transitions. [2025-03-09 00:26:13,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:26:13,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-09 00:26:13,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:13,805 INFO L225 Difference]: With dead ends: 236 [2025-03-09 00:26:13,805 INFO L226 Difference]: Without dead ends: 236 [2025-03-09 00:26:13,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:13,806 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 10 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:13,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 589 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:13,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-09 00:26:13,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2025-03-09 00:26:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 141 states have (on average 1.8581560283687943) internal successors, (262), 231 states have internal predecessors, (262), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 266 transitions. [2025-03-09 00:26:13,821 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 266 transitions. Word has length 6 [2025-03-09 00:26:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:13,821 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 266 transitions. [2025-03-09 00:26:13,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-09 00:26:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 266 transitions. [2025-03-09 00:26:13,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:26:13,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:13,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:13,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:26:13,822 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:13,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:13,822 INFO L85 PathProgramCache]: Analyzing trace with hash -751142265, now seen corresponding path program 1 times [2025-03-09 00:26:13,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:13,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008769626] [2025-03-09 00:26:13,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:13,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:13,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:26:13,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:26:13,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:13,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:13,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:13,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008769626] [2025-03-09 00:26:13,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008769626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:13,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468886666] [2025-03-09 00:26:13,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:13,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:13,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:13,973 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-09 00:26:13,977 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-09 00:26:14,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:26:14,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:26:14,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:14,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:14,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:26:14,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:14,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:14,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468886666] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:14,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:14,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 00:26:14,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141634824] [2025-03-09 00:26:14,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:14,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:26:14,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:14,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:26:14,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:14,238 INFO L87 Difference]: Start difference. First operand 235 states and 266 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-09 00:26:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:14,266 INFO L93 Difference]: Finished difference Result 243 states and 276 transitions. [2025-03-09 00:26:14,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:26:14,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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 9 [2025-03-09 00:26:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:14,268 INFO L225 Difference]: With dead ends: 243 [2025-03-09 00:26:14,268 INFO L226 Difference]: Without dead ends: 243 [2025-03-09 00:26:14,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:14,269 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 4 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:14,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 517 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:14,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-09 00:26:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-03-09 00:26:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 149 states have (on average 1.825503355704698) internal successors, (272), 239 states have internal predecessors, (272), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 276 transitions. [2025-03-09 00:26:14,276 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 276 transitions. Word has length 9 [2025-03-09 00:26:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:14,276 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 276 transitions. [2025-03-09 00:26:14,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-09 00:26:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 276 transitions. [2025-03-09 00:26:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:26:14,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:14,277 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:14,287 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-09 00:26:14,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:14,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:14,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:14,478 INFO L85 PathProgramCache]: Analyzing trace with hash -751142104, now seen corresponding path program 1 times [2025-03-09 00:26:14,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:14,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949811021] [2025-03-09 00:26:14,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:14,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:14,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:26:14,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:26:14,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:14,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:14,770 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-09 00:26:14,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949811021] [2025-03-09 00:26:14,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949811021] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995422209] [2025-03-09 00:26:14,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:14,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:14,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:14,774 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-09 00:26:14,776 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-09 00:26:14,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:26:14,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:26:14,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:14,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:14,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 00:26:15,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:15,076 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-09 00:26:15,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:15,153 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 7 treesize of output 5 [2025-03-09 00:26:15,167 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-09 00:26:15,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995422209] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:15,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:15,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-09 00:26:15,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866921790] [2025-03-09 00:26:15,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:15,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:26:15,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:15,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:26:15,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:26:15,170 INFO L87 Difference]: Start difference. First operand 243 states and 276 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-09 00:26:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:15,489 INFO L93 Difference]: Finished difference Result 242 states and 273 transitions. [2025-03-09 00:26:15,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:26:15,491 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 00:26:15,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:15,492 INFO L225 Difference]: With dead ends: 242 [2025-03-09 00:26:15,492 INFO L226 Difference]: Without dead ends: 242 [2025-03-09 00:26:15,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:26:15,493 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 258 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:15,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 945 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:26:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-09 00:26:15,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2025-03-09 00:26:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 149 states have (on average 1.8053691275167785) internal successors, (269), 238 states have internal predecessors, (269), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 273 transitions. [2025-03-09 00:26:15,501 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 273 transitions. Word has length 9 [2025-03-09 00:26:15,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:15,501 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 273 transitions. [2025-03-09 00:26:15,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-09 00:26:15,501 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 273 transitions. [2025-03-09 00:26:15,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 00:26:15,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:15,501 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:15,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 00:26:15,702 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,SelfDestructingSolverStorable5 [2025-03-09 00:26:15,702 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:15,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:15,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1239539907, now seen corresponding path program 2 times [2025-03-09 00:26:15,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:15,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422485523] [2025-03-09 00:26:15,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:26:15,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:15,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 00:26:15,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-09 00:26:15,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:26:15,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:15,944 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 00:26:15,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:15,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422485523] [2025-03-09 00:26:15,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422485523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:15,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:15,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:26:15,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045484178] [2025-03-09 00:26:15,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:15,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:26:15,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:15,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:26:15,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:15,945 INFO L87 Difference]: Start difference. First operand 242 states and 273 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:16,064 INFO L93 Difference]: Finished difference Result 257 states and 289 transitions. [2025-03-09 00:26:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:16,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-09 00:26:16,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:16,066 INFO L225 Difference]: With dead ends: 257 [2025-03-09 00:26:16,066 INFO L226 Difference]: Without dead ends: 257 [2025-03-09 00:26:16,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:16,067 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 474 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:16,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 212 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-09 00:26:16,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 241. [2025-03-09 00:26:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 149 states have (on average 1.7986577181208054) internal successors, (268), 237 states have internal predecessors, (268), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2025-03-09 00:26:16,072 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 18 [2025-03-09 00:26:16,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:16,072 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2025-03-09 00:26:16,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:16,072 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2025-03-09 00:26:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 00:26:16,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:16,072 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:16,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:26:16,073 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:16,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:16,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1239539906, now seen corresponding path program 1 times [2025-03-09 00:26:16,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:16,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30249178] [2025-03-09 00:26:16,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:16,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:16,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:26:16,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:26:16,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:16,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:16,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:16,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30249178] [2025-03-09 00:26:16,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30249178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:16,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302101762] [2025-03-09 00:26:16,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:16,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:16,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:16,259 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-09 00:26:16,261 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-09 00:26:16,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:26:16,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:26:16,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:16,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:16,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:26:16,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:16,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:16,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302101762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:16,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:16,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 00:26:16,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218205639] [2025-03-09 00:26:16,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:16,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:26:16,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:16,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:26:16,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:26:16,596 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:16,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:16,657 INFO L93 Difference]: Finished difference Result 259 states and 290 transitions. [2025-03-09 00:26:16,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:26:16,658 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-09 00:26:16,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:16,659 INFO L225 Difference]: With dead ends: 259 [2025-03-09 00:26:16,661 INFO L226 Difference]: Without dead ends: 259 [2025-03-09 00:26:16,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:26:16,662 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 4 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:16,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1539 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:16,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-09 00:26:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-03-09 00:26:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 167 states have (on average 1.7125748502994012) internal successors, (286), 255 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:16,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2025-03-09 00:26:16,672 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 18 [2025-03-09 00:26:16,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:16,672 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2025-03-09 00:26:16,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:16,673 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2025-03-09 00:26:16,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 00:26:16,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:16,673 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:16,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:16,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:16,874 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:16,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:16,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1993504130, now seen corresponding path program 2 times [2025-03-09 00:26:16,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:16,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713181890] [2025-03-09 00:26:16,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:26:16,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:16,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 00:26:16,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-09 00:26:16,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:26:16,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:17,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:17,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713181890] [2025-03-09 00:26:17,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713181890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:17,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:17,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:26:17,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064698929] [2025-03-09 00:26:17,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:17,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:26:17,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:17,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:26:17,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:26:17,094 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:17,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:17,284 INFO L93 Difference]: Finished difference Result 274 states and 306 transitions. [2025-03-09 00:26:17,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:26:17,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-09 00:26:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:17,286 INFO L225 Difference]: With dead ends: 274 [2025-03-09 00:26:17,286 INFO L226 Difference]: Without dead ends: 274 [2025-03-09 00:26:17,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:17,286 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 759 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:17,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 145 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:17,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-09 00:26:17,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 258. [2025-03-09 00:26:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 167 states have (on average 1.7065868263473054) internal successors, (285), 254 states have internal predecessors, (285), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 289 transitions. [2025-03-09 00:26:17,292 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 289 transitions. Word has length 36 [2025-03-09 00:26:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:17,292 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 289 transitions. [2025-03-09 00:26:17,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 289 transitions. [2025-03-09 00:26:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 00:26:17,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:17,293 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:17,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:26:17,293 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:17,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:17,294 INFO L85 PathProgramCache]: Analyzing trace with hash 303212061, now seen corresponding path program 1 times [2025-03-09 00:26:17,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:17,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027510281] [2025-03-09 00:26:17,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:17,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:17,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 00:26:17,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 00:26:17,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:17,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:17,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:17,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027510281] [2025-03-09 00:26:17,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027510281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:17,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:17,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:17,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922908932] [2025-03-09 00:26:17,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:17,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:17,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:17,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:17,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:17,543 INFO L87 Difference]: Start difference. First operand 258 states and 289 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:17,654 INFO L93 Difference]: Finished difference Result 269 states and 301 transitions. [2025-03-09 00:26:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:17,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-09 00:26:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:17,655 INFO L225 Difference]: With dead ends: 269 [2025-03-09 00:26:17,655 INFO L226 Difference]: Without dead ends: 269 [2025-03-09 00:26:17,655 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-09 00:26:17,656 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 216 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:17,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 202 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:17,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-09 00:26:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 253. [2025-03-09 00:26:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 167 states have (on average 1.6766467065868262) internal successors, (280), 249 states have internal predecessors, (280), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 284 transitions. [2025-03-09 00:26:17,661 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 284 transitions. Word has length 44 [2025-03-09 00:26:17,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:17,666 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 284 transitions. [2025-03-09 00:26:17,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 284 transitions. [2025-03-09 00:26:17,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 00:26:17,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:17,666 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:17,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:26:17,666 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:17,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:17,667 INFO L85 PathProgramCache]: Analyzing trace with hash 303212062, now seen corresponding path program 1 times [2025-03-09 00:26:17,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:17,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754963344] [2025-03-09 00:26:17,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:17,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:17,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 00:26:17,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 00:26:17,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:17,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:18,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:18,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754963344] [2025-03-09 00:26:18,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754963344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:18,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:18,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:26:18,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094203924] [2025-03-09 00:26:18,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:18,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:26:18,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:18,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:26:18,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:18,242 INFO L87 Difference]: Start difference. First operand 253 states and 284 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:18,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:18,514 INFO L93 Difference]: Finished difference Result 413 states and 474 transitions. [2025-03-09 00:26:18,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:26:18,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-09 00:26:18,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:18,517 INFO L225 Difference]: With dead ends: 413 [2025-03-09 00:26:18,517 INFO L226 Difference]: Without dead ends: 413 [2025-03-09 00:26:18,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:18,517 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 593 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 730 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.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:18,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 730 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:26:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-09 00:26:18,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 252. [2025-03-09 00:26:18,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 167 states have (on average 1.6706586826347305) internal successors, (279), 248 states have internal predecessors, (279), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 283 transitions. [2025-03-09 00:26:18,525 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 283 transitions. Word has length 44 [2025-03-09 00:26:18,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:18,526 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 283 transitions. [2025-03-09 00:26:18,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2025-03-09 00:26:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:26:18,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:18,527 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:18,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:26:18,527 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:18,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash 674535965, now seen corresponding path program 1 times [2025-03-09 00:26:18,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:18,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878487861] [2025-03-09 00:26:18,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:18,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:18,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:26:18,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:26:18,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:18,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:18,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:18,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878487861] [2025-03-09 00:26:18,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878487861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:18,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:18,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:26:18,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804114407] [2025-03-09 00:26:18,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:18,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:26:18,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:18,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:26:18,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:18,842 INFO L87 Difference]: Start difference. First operand 252 states and 283 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:19,030 INFO L93 Difference]: Finished difference Result 286 states and 321 transitions. [2025-03-09 00:26:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:26:19,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-09 00:26:19,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:19,031 INFO L225 Difference]: With dead ends: 286 [2025-03-09 00:26:19,031 INFO L226 Difference]: Without dead ends: 286 [2025-03-09 00:26:19,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:19,032 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 527 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:19,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 272 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-09 00:26:19,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 265. [2025-03-09 00:26:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 181 states have (on average 1.6574585635359116) internal successors, (300), 261 states have internal predecessors, (300), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 304 transitions. [2025-03-09 00:26:19,037 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 304 transitions. Word has length 47 [2025-03-09 00:26:19,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:19,037 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 304 transitions. [2025-03-09 00:26:19,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 304 transitions. [2025-03-09 00:26:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:26:19,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:19,038 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:19,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:26:19,038 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:19,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:19,039 INFO L85 PathProgramCache]: Analyzing trace with hash 674535036, now seen corresponding path program 1 times [2025-03-09 00:26:19,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:19,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062431591] [2025-03-09 00:26:19,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:19,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:19,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:26:19,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:26:19,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:19,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:19,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:19,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062431591] [2025-03-09 00:26:19,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062431591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:19,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:19,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:26:19,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387268014] [2025-03-09 00:26:19,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:19,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:26:19,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:19,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:26:19,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:19,186 INFO L87 Difference]: Start difference. First operand 265 states and 304 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:19,327 INFO L93 Difference]: Finished difference Result 296 states and 342 transitions. [2025-03-09 00:26:19,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:26:19,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-09 00:26:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:19,328 INFO L225 Difference]: With dead ends: 296 [2025-03-09 00:26:19,328 INFO L226 Difference]: Without dead ends: 296 [2025-03-09 00:26:19,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:26:19,329 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 385 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 255 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-09 00:26:19,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 255 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:19,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-09 00:26:19,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 258. [2025-03-09 00:26:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 181 states have (on average 1.6187845303867403) internal successors, (293), 254 states have internal predecessors, (293), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 297 transitions. [2025-03-09 00:26:19,334 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 297 transitions. Word has length 47 [2025-03-09 00:26:19,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:19,334 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 297 transitions. [2025-03-09 00:26:19,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 297 transitions. [2025-03-09 00:26:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:26:19,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:19,335 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:19,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:26:19,335 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:19,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:19,335 INFO L85 PathProgramCache]: Analyzing trace with hash 674535037, now seen corresponding path program 1 times [2025-03-09 00:26:19,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:19,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107597903] [2025-03-09 00:26:19,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:19,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:19,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:26:19,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:26:19,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:19,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:19,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:19,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107597903] [2025-03-09 00:26:19,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107597903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:19,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:19,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:26:19,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420261748] [2025-03-09 00:26:19,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:19,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:26:19,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:19,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:26:19,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:19,575 INFO L87 Difference]: Start difference. First operand 258 states and 297 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:19,638 INFO L93 Difference]: Finished difference Result 263 states and 296 transitions. [2025-03-09 00:26:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:26:19,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-09 00:26:19,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:19,639 INFO L225 Difference]: With dead ends: 263 [2025-03-09 00:26:19,639 INFO L226 Difference]: Without dead ends: 263 [2025-03-09 00:26:19,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:19,640 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 229 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:19,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 940 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:19,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-09 00:26:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 258. [2025-03-09 00:26:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 181 states have (on average 1.6132596685082874) internal successors, (292), 254 states have internal predecessors, (292), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 296 transitions. [2025-03-09 00:26:19,646 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 296 transitions. Word has length 47 [2025-03-09 00:26:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:19,646 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 296 transitions. [2025-03-09 00:26:19,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 296 transitions. [2025-03-09 00:26:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 00:26:19,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:19,647 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:19,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:26:19,647 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:19,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:19,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1050829288, now seen corresponding path program 1 times [2025-03-09 00:26:19,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:19,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400892781] [2025-03-09 00:26:19,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:19,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:19,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 00:26:19,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 00:26:19,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:19,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:19,867 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:19,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:19,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400892781] [2025-03-09 00:26:19,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400892781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:19,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:19,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:19,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105205310] [2025-03-09 00:26:19,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:19,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:19,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:19,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:19,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:19,869 INFO L87 Difference]: Start difference. First operand 258 states and 296 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:19,967 INFO L93 Difference]: Finished difference Result 263 states and 303 transitions. [2025-03-09 00:26:19,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:19,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-09 00:26:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:19,968 INFO L225 Difference]: With dead ends: 263 [2025-03-09 00:26:19,968 INFO L226 Difference]: Without dead ends: 263 [2025-03-09 00:26:19,970 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-09 00:26:19,970 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 202 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:19,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 198 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:19,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-09 00:26:19,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2025-03-09 00:26:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 186 states have (on average 1.60752688172043) internal successors, (299), 258 states have internal predecessors, (299), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 303 transitions. [2025-03-09 00:26:19,975 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 303 transitions. Word has length 50 [2025-03-09 00:26:19,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:19,975 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 303 transitions. [2025-03-09 00:26:19,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 303 transitions. [2025-03-09 00:26:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 00:26:19,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:19,976 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:26:19,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 00:26:19,976 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:19,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:19,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1050829287, now seen corresponding path program 1 times [2025-03-09 00:26:19,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:19,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593487433] [2025-03-09 00:26:19,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:20,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 00:26:20,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 00:26:20,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:20,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:20,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:20,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593487433] [2025-03-09 00:26:20,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593487433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:20,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:20,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 00:26:20,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971914174] [2025-03-09 00:26:20,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:20,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:26:20,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:20,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:26:20,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:26:20,593 INFO L87 Difference]: Start difference. First operand 262 states and 303 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:21,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:21,269 INFO L93 Difference]: Finished difference Result 424 states and 491 transitions. [2025-03-09 00:26:21,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:26:21,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-09 00:26:21,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:21,271 INFO L225 Difference]: With dead ends: 424 [2025-03-09 00:26:21,271 INFO L226 Difference]: Without dead ends: 424 [2025-03-09 00:26:21,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:26:21,272 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 602 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:21,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 735 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 00:26:21,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-09 00:26:21,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 262. [2025-03-09 00:26:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 186 states have (on average 1.6021505376344085) internal successors, (298), 258 states have internal predecessors, (298), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 302 transitions. [2025-03-09 00:26:21,278 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 302 transitions. Word has length 50 [2025-03-09 00:26:21,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:21,278 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 302 transitions. [2025-03-09 00:26:21,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:21,278 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 302 transitions. [2025-03-09 00:26:21,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 00:26:21,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:21,280 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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-09 00:26:21,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 00:26:21,280 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:21,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:21,280 INFO L85 PathProgramCache]: Analyzing trace with hash 761539957, now seen corresponding path program 1 times [2025-03-09 00:26:21,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:21,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529676971] [2025-03-09 00:26:21,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:21,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:21,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 00:26:21,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 00:26:21,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:21,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:21,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:21,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529676971] [2025-03-09 00:26:21,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529676971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:21,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:21,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:26:21,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612490511] [2025-03-09 00:26:21,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:21,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:26:21,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:21,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:26:21,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:26:21,504 INFO L87 Difference]: Start difference. First operand 262 states and 302 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:21,687 INFO L93 Difference]: Finished difference Result 261 states and 300 transitions. [2025-03-09 00:26:21,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:26:21,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-09 00:26:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:21,689 INFO L225 Difference]: With dead ends: 261 [2025-03-09 00:26:21,689 INFO L226 Difference]: Without dead ends: 261 [2025-03-09 00:26:21,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:21,690 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 12 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:21,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 701 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-09 00:26:21,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-03-09 00:26:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 186 states have (on average 1.5913978494623655) internal successors, (296), 257 states have internal predecessors, (296), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 300 transitions. [2025-03-09 00:26:21,694 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 300 transitions. Word has length 53 [2025-03-09 00:26:21,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:21,695 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 300 transitions. [2025-03-09 00:26:21,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:21,695 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 300 transitions. [2025-03-09 00:26:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 00:26:21,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:21,695 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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-09 00:26:21,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 00:26:21,696 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:21,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:21,696 INFO L85 PathProgramCache]: Analyzing trace with hash 761539958, now seen corresponding path program 1 times [2025-03-09 00:26:21,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:21,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009643732] [2025-03-09 00:26:21,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:21,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:21,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 00:26:21,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 00:26:21,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:21,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:22,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:22,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009643732] [2025-03-09 00:26:22,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009643732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:22,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:22,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:26:22,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235404894] [2025-03-09 00:26:22,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:22,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:26:22,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:22,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:26:22,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:26:22,087 INFO L87 Difference]: Start difference. First operand 261 states and 300 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:22,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:22,277 INFO L93 Difference]: Finished difference Result 260 states and 298 transitions. [2025-03-09 00:26:22,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:26:22,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-09 00:26:22,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:22,278 INFO L225 Difference]: With dead ends: 260 [2025-03-09 00:26:22,278 INFO L226 Difference]: Without dead ends: 260 [2025-03-09 00:26:22,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:22,279 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 11 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:22,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 703 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:22,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-09 00:26:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2025-03-09 00:26:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 186 states have (on average 1.5806451612903225) internal successors, (294), 256 states have internal predecessors, (294), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 298 transitions. [2025-03-09 00:26:22,284 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 298 transitions. Word has length 53 [2025-03-09 00:26:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:22,284 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 298 transitions. [2025-03-09 00:26:22,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 298 transitions. [2025-03-09 00:26:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 00:26:22,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:22,285 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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-09 00:26:22,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 00:26:22,285 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:22,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:22,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1550039529, now seen corresponding path program 1 times [2025-03-09 00:26:22,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:22,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067402479] [2025-03-09 00:26:22,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:22,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:22,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 00:26:22,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 00:26:22,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:22,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:22,388 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:22,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:22,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067402479] [2025-03-09 00:26:22,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067402479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:22,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:22,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:26:22,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137273094] [2025-03-09 00:26:22,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:22,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:22,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:22,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:22,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:22,390 INFO L87 Difference]: Start difference. First operand 260 states and 298 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:22,401 INFO L93 Difference]: Finished difference Result 272 states and 313 transitions. [2025-03-09 00:26:22,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:22,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-03-09 00:26:22,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:22,402 INFO L225 Difference]: With dead ends: 272 [2025-03-09 00:26:22,403 INFO L226 Difference]: Without dead ends: 272 [2025-03-09 00:26:22,403 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-09 00:26:22,403 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 6 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:22,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 477 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-09 00:26:22,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 262. [2025-03-09 00:26:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 188 states have (on average 1.574468085106383) internal successors, (296), 258 states have internal predecessors, (296), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 300 transitions. [2025-03-09 00:26:22,409 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 300 transitions. Word has length 57 [2025-03-09 00:26:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:22,409 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 300 transitions. [2025-03-09 00:26:22,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 300 transitions. [2025-03-09 00:26:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 00:26:22,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:22,410 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 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-09 00:26:22,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 00:26:22,410 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:22,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash 806831694, now seen corresponding path program 1 times [2025-03-09 00:26:22,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:22,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384743992] [2025-03-09 00:26:22,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:22,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:22,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 00:26:22,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 00:26:22,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:22,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:22,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:22,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384743992] [2025-03-09 00:26:22,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384743992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:22,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:22,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:26:22,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145943059] [2025-03-09 00:26:22,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:22,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:26:22,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:22,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:26:22,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:26:22,564 INFO L87 Difference]: Start difference. First operand 262 states and 300 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:22,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:22,715 INFO L93 Difference]: Finished difference Result 261 states and 298 transitions. [2025-03-09 00:26:22,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:26:22,716 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-03-09 00:26:22,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:22,717 INFO L225 Difference]: With dead ends: 261 [2025-03-09 00:26:22,717 INFO L226 Difference]: Without dead ends: 261 [2025-03-09 00:26:22,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:22,719 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 5 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:22,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 761 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-09 00:26:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-03-09 00:26:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 188 states have (on average 1.5638297872340425) internal successors, (294), 257 states have internal predecessors, (294), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 298 transitions. [2025-03-09 00:26:22,728 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 298 transitions. Word has length 58 [2025-03-09 00:26:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:22,729 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 298 transitions. [2025-03-09 00:26:22,729 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 298 transitions. [2025-03-09 00:26:22,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 00:26:22,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:22,729 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 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-09 00:26:22,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 00:26:22,730 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:22,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:22,731 INFO L85 PathProgramCache]: Analyzing trace with hash 806831695, now seen corresponding path program 1 times [2025-03-09 00:26:22,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:22,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625245508] [2025-03-09 00:26:22,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:22,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:22,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 00:26:22,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 00:26:22,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:22,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:23,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:23,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625245508] [2025-03-09 00:26:23,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625245508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:23,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:23,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:26:23,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118598407] [2025-03-09 00:26:23,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:23,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:26:23,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:23,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:26:23,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:23,334 INFO L87 Difference]: Start difference. First operand 261 states and 298 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:23,565 INFO L93 Difference]: Finished difference Result 269 states and 307 transitions. [2025-03-09 00:26:23,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:26:23,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-03-09 00:26:23,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:23,567 INFO L225 Difference]: With dead ends: 269 [2025-03-09 00:26:23,567 INFO L226 Difference]: Without dead ends: 269 [2025-03-09 00:26:23,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:26:23,568 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 14 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:23,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 700 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-09 00:26:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 267. [2025-03-09 00:26:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 194 states have (on average 1.5515463917525774) internal successors, (301), 263 states have internal predecessors, (301), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 305 transitions. [2025-03-09 00:26:23,572 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 305 transitions. Word has length 58 [2025-03-09 00:26:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:23,573 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 305 transitions. [2025-03-09 00:26:23,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 305 transitions. [2025-03-09 00:26:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 00:26:23,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:23,574 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-03-09 00:26:23,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 00:26:23,574 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:23,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:23,575 INFO L85 PathProgramCache]: Analyzing trace with hash 733521643, now seen corresponding path program 1 times [2025-03-09 00:26:23,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:23,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309392885] [2025-03-09 00:26:23,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:23,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:23,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 00:26:23,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 00:26:23,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:23,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:23,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:23,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309392885] [2025-03-09 00:26:23,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309392885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:23,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102347846] [2025-03-09 00:26:23,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:23,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:23,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:23,694 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-09 00:26:23,697 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-09 00:26:23,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 00:26:23,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 00:26:23,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:23,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:23,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 1267 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:26:23,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:23,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:24,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102347846] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:24,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:24,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 00:26:24,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451084798] [2025-03-09 00:26:24,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:24,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:26:24,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:24,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:26:24,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:24,018 INFO L87 Difference]: Start difference. First operand 267 states and 305 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:24,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:24,043 INFO L93 Difference]: Finished difference Result 294 states and 335 transitions. [2025-03-09 00:26:24,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:26:24,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-03-09 00:26:24,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:24,045 INFO L225 Difference]: With dead ends: 294 [2025-03-09 00:26:24,045 INFO L226 Difference]: Without dead ends: 294 [2025-03-09 00:26:24,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:24,047 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 17 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:24,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 481 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-09 00:26:24,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2025-03-09 00:26:24,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 218 states have (on average 1.518348623853211) internal successors, (331), 287 states have internal predecessors, (331), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 335 transitions. [2025-03-09 00:26:24,054 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 335 transitions. Word has length 62 [2025-03-09 00:26:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:24,054 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 335 transitions. [2025-03-09 00:26:24,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 335 transitions. [2025-03-09 00:26:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 00:26:24,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:24,055 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-03-09 00:26:24,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 00:26:24,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:24,256 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:24,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:24,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1264581005, now seen corresponding path program 1 times [2025-03-09 00:26:24,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:24,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223603095] [2025-03-09 00:26:24,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:24,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:24,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 00:26:24,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 00:26:24,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:24,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:24,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:24,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223603095] [2025-03-09 00:26:24,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223603095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:24,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180357526] [2025-03-09 00:26:24,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:24,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:24,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:24,738 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-09 00:26:24,740 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-09 00:26:24,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 00:26:25,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 00:26:25,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:25,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:25,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 00:26:25,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:25,071 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-09 00:26:25,090 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 23 treesize of output 1 [2025-03-09 00:26:25,094 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 23 treesize of output 1 [2025-03-09 00:26:25,253 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 36 treesize of output 12 [2025-03-09 00:26:25,256 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 25 treesize of output 9 [2025-03-09 00:26:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:25,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:25,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180357526] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:25,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:25,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2025-03-09 00:26:25,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304012755] [2025-03-09 00:26:25,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:25,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 00:26:25,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:25,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 00:26:25,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2025-03-09 00:26:25,512 INFO L87 Difference]: Start difference. First operand 291 states and 335 transitions. Second operand has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:26,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:26,072 INFO L93 Difference]: Finished difference Result 290 states and 329 transitions. [2025-03-09 00:26:26,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:26:26,073 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-03-09 00:26:26,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:26,074 INFO L225 Difference]: With dead ends: 290 [2025-03-09 00:26:26,074 INFO L226 Difference]: Without dead ends: 290 [2025-03-09 00:26:26,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2025-03-09 00:26:26,075 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 43 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:26,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1467 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:26:26,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-09 00:26:26,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-03-09 00:26:26,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 218 states have (on average 1.4908256880733946) internal successors, (325), 286 states have internal predecessors, (325), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 329 transitions. [2025-03-09 00:26:26,080 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 329 transitions. Word has length 63 [2025-03-09 00:26:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:26,081 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 329 transitions. [2025-03-09 00:26:26,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 329 transitions. [2025-03-09 00:26:26,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-09 00:26:26,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:26,082 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 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-09 00:26:26,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 00:26:26,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-09 00:26:26,282 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:26,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:26,283 INFO L85 PathProgramCache]: Analyzing trace with hash -970273687, now seen corresponding path program 2 times [2025-03-09 00:26:26,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:26,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095732931] [2025-03-09 00:26:26,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:26:26,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:26,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-09 00:26:26,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 00:26:26,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:26:26,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:26,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:26,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095732931] [2025-03-09 00:26:26,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095732931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:26,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765777853] [2025-03-09 00:26:26,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:26:26,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:26,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:26,476 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-09 00:26:26,477 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-09 00:26:26,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-09 00:26:26,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 00:26:26,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:26:26,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:26,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:26:26,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:26,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:26:26,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765777853] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:26,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:26,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 00:26:26,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746490274] [2025-03-09 00:26:26,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:26,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:26:26,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:26,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:26:26,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:26:26,877 INFO L87 Difference]: Start difference. First operand 290 states and 329 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:26,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:26,916 INFO L93 Difference]: Finished difference Result 359 states and 395 transitions. [2025-03-09 00:26:26,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:26:26,916 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2025-03-09 00:26:26,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:26,917 INFO L225 Difference]: With dead ends: 359 [2025-03-09 00:26:26,917 INFO L226 Difference]: Without dead ends: 359 [2025-03-09 00:26:26,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:26:26,918 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 30 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:26,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 732 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:26,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-09 00:26:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 350. [2025-03-09 00:26:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 278 states have (on average 1.4064748201438848) internal successors, (391), 346 states have internal predecessors, (391), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 395 transitions. [2025-03-09 00:26:26,924 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 395 transitions. Word has length 77 [2025-03-09 00:26:26,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:26,925 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 395 transitions. [2025-03-09 00:26:26,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:26,925 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 395 transitions. [2025-03-09 00:26:26,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-09 00:26:26,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:26,925 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-09 00:26:26,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:27,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:27,126 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:27,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:27,127 INFO L85 PathProgramCache]: Analyzing trace with hash 181088297, now seen corresponding path program 3 times [2025-03-09 00:26:27,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:27,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768489430] [2025-03-09 00:26:27,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:26:27,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:27,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 107 statements into 12 equivalence classes. [2025-03-09 00:26:27,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 107 statements. [2025-03-09 00:26:27,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 00:26:27,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:27,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:27,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768489430] [2025-03-09 00:26:27,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768489430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:27,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570557868] [2025-03-09 00:26:27,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:26:27,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:27,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:27,518 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:27,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:26:27,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 107 statements into 12 equivalence classes. [2025-03-09 00:26:27,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 107 statements. [2025-03-09 00:26:27,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 00:26:27,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:27,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 00:26:27,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:27,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:27,872 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 19 treesize of output 14 [2025-03-09 00:26:27,882 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:27,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:28,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:28,344 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 16 treesize of output 11 [2025-03-09 00:26:28,352 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:28,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:28,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:29,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:26:29,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-03-09 00:26:29,599 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 49 treesize of output 45 [2025-03-09 00:26:29,627 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-09 00:26:29,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2025-03-09 00:26:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:29,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570557868] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:29,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:29,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-09 00:26:29,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326859559] [2025-03-09 00:26:29,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:29,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 00:26:29,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:29,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 00:26:29,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2025-03-09 00:26:29,662 INFO L87 Difference]: Start difference. First operand 350 states and 395 transitions. Second operand has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 20 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:30,239 INFO L93 Difference]: Finished difference Result 413 states and 451 transitions. [2025-03-09 00:26:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:26:30,239 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 20 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2025-03-09 00:26:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:30,241 INFO L225 Difference]: With dead ends: 413 [2025-03-09 00:26:30,241 INFO L226 Difference]: Without dead ends: 413 [2025-03-09 00:26:30,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2025-03-09 00:26:30,242 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 392 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:30,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 746 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:26:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-09 00:26:30,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 291. [2025-03-09 00:26:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 223 states have (on average 1.4439461883408071) internal successors, (322), 287 states have internal predecessors, (322), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 326 transitions. [2025-03-09 00:26:30,247 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 326 transitions. Word has length 107 [2025-03-09 00:26:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:30,247 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 326 transitions. [2025-03-09 00:26:30,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 20 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 326 transitions. [2025-03-09 00:26:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-09 00:26:30,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:30,248 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 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-09 00:26:30,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:30,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:30,452 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:30,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:30,452 INFO L85 PathProgramCache]: Analyzing trace with hash 181087369, now seen corresponding path program 1 times [2025-03-09 00:26:30,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:30,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677913726] [2025-03-09 00:26:30,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:30,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:30,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 00:26:30,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 00:26:30,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:30,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:30,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:30,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677913726] [2025-03-09 00:26:30,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677913726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:30,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762221823] [2025-03-09 00:26:30,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:30,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:30,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:30,971 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:30,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 00:26:31,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 00:26:31,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 00:26:31,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:31,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:31,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 00:26:31,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:31,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:31,369 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 16 treesize of output 11 [2025-03-09 00:26:31,375 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:31,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:31,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:31,785 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 49 treesize of output 45 [2025-03-09 00:26:31,804 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-09 00:26:31,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2025-03-09 00:26:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:31,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762221823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:31,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:31,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-03-09 00:26:31,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177196906] [2025-03-09 00:26:31,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:31,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 00:26:31,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:31,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 00:26:31,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-03-09 00:26:31,834 INFO L87 Difference]: Start difference. First operand 291 states and 326 transitions. Second operand has 18 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:32,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:32,373 INFO L93 Difference]: Finished difference Result 355 states and 389 transitions. [2025-03-09 00:26:32,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:26:32,373 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2025-03-09 00:26:32,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:32,375 INFO L225 Difference]: With dead ends: 355 [2025-03-09 00:26:32,375 INFO L226 Difference]: Without dead ends: 355 [2025-03-09 00:26:32,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2025-03-09 00:26:32,376 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 918 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:32,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 784 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:26:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-09 00:26:32,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 288. [2025-03-09 00:26:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 223 states have (on average 1.4304932735426008) internal successors, (319), 284 states have internal predecessors, (319), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:32,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 323 transitions. [2025-03-09 00:26:32,380 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 323 transitions. Word has length 107 [2025-03-09 00:26:32,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:32,381 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 323 transitions. [2025-03-09 00:26:32,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:32,381 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 323 transitions. [2025-03-09 00:26:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 00:26:32,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:32,382 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-09 00:26:32,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:32,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-09 00:26:32,582 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:32,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:32,583 INFO L85 PathProgramCache]: Analyzing trace with hash 322747533, now seen corresponding path program 1 times [2025-03-09 00:26:32,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:32,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041364014] [2025-03-09 00:26:32,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:32,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:32,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 00:26:32,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 00:26:32,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:32,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:33,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:33,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041364014] [2025-03-09 00:26:33,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041364014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:33,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153818130] [2025-03-09 00:26:33,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:33,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:33,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:33,374 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:33,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 00:26:33,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 00:26:33,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 00:26:33,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:33,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:33,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 00:26:33,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:33,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-03-09 00:26:33,754 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-09 00:26:33,765 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-09 00:26:33,766 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 1 case distinctions, treesize of input 21 treesize of output 23 [2025-03-09 00:26:33,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:33,926 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-03-09 00:26:33,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 40 treesize of output 40 [2025-03-09 00:26:33,934 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:33,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:34,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:34,618 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 32 treesize of output 25 [2025-03-09 00:26:34,625 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:34,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:34,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:35,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:26:35,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-03-09 00:26:35,789 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:35,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153818130] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:35,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:35,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2025-03-09 00:26:35,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039003703] [2025-03-09 00:26:35,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:35,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 00:26:35,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:35,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 00:26:35,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2025-03-09 00:26:35,791 INFO L87 Difference]: Start difference. First operand 288 states and 323 transitions. Second operand has 22 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 22 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:36,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:36,857 INFO L93 Difference]: Finished difference Result 408 states and 446 transitions. [2025-03-09 00:26:36,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:26:36,857 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 22 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2025-03-09 00:26:36,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:36,858 INFO L225 Difference]: With dead ends: 408 [2025-03-09 00:26:36,858 INFO L226 Difference]: Without dead ends: 408 [2025-03-09 00:26:36,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2025-03-09 00:26:36,859 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1001 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:36,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 1101 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 00:26:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-09 00:26:36,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 283. [2025-03-09 00:26:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 219 states have (on average 1.4337899543378996) internal successors, (314), 279 states have internal predecessors, (314), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 318 transitions. [2025-03-09 00:26:36,863 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 318 transitions. Word has length 110 [2025-03-09 00:26:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:36,864 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 318 transitions. [2025-03-09 00:26:36,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 22 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 318 transitions. [2025-03-09 00:26:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 00:26:36,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:36,865 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 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-09 00:26:36,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 00:26:37,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-09 00:26:37,066 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:37,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:37,068 INFO L85 PathProgramCache]: Analyzing trace with hash 295070476, now seen corresponding path program 1 times [2025-03-09 00:26:37,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:37,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117976465] [2025-03-09 00:26:37,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:37,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:37,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 00:26:37,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 00:26:37,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:37,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:37,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:37,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117976465] [2025-03-09 00:26:37,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117976465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:37,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:37,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:26:37,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129044439] [2025-03-09 00:26:37,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:37,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:26:37,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:37,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:26:37,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:26:37,564 INFO L87 Difference]: Start difference. First operand 283 states and 318 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:37,715 INFO L93 Difference]: Finished difference Result 330 states and 376 transitions. [2025-03-09 00:26:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:26:37,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2025-03-09 00:26:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:37,717 INFO L225 Difference]: With dead ends: 330 [2025-03-09 00:26:37,717 INFO L226 Difference]: Without dead ends: 330 [2025-03-09 00:26:37,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:26:37,718 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 412 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:37,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 521 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:37,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-09 00:26:37,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 286. [2025-03-09 00:26:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 222 states have (on average 1.4324324324324325) internal successors, (318), 282 states have internal predecessors, (318), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 00:26:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 322 transitions. [2025-03-09 00:26:37,726 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 322 transitions. Word has length 110 [2025-03-09 00:26:37,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:37,726 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 322 transitions. [2025-03-09 00:26:37,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 322 transitions. [2025-03-09 00:26:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-09 00:26:37,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:37,727 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:37,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 00:26:37,728 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:37,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash 94697702, now seen corresponding path program 1 times [2025-03-09 00:26:37,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:37,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145447200] [2025-03-09 00:26:37,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:37,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:37,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-09 00:26:37,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-09 00:26:37,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:37,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:38,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:38,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145447200] [2025-03-09 00:26:38,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145447200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:38,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077543381] [2025-03-09 00:26:38,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:38,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:38,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:38,153 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:38,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 00:26:38,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-09 00:26:38,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-09 00:26:38,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:38,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:38,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 1550 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:26:38,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:38,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:39,052 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 22 treesize of output 18 [2025-03-09 00:26:39,074 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:39,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077543381] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:39,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:39,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-09 00:26:39,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883032299] [2025-03-09 00:26:39,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:39,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 00:26:39,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:39,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 00:26:39,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:26:39,077 INFO L87 Difference]: Start difference. First operand 286 states and 322 transitions. Second operand has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:39,409 INFO L93 Difference]: Finished difference Result 412 states and 461 transitions. [2025-03-09 00:26:39,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:26:39,409 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2025-03-09 00:26:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:39,410 INFO L225 Difference]: With dead ends: 412 [2025-03-09 00:26:39,410 INFO L226 Difference]: Without dead ends: 412 [2025-03-09 00:26:39,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:26:39,411 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 646 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:39,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 1005 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:26:39,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-09 00:26:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 329. [2025-03-09 00:26:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 265 states have (on average 1.4641509433962263) internal successors, (388), 324 states have internal predecessors, (388), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:26:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 394 transitions. [2025-03-09 00:26:39,419 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 394 transitions. Word has length 112 [2025-03-09 00:26:39,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:39,419 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 394 transitions. [2025-03-09 00:26:39,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:39,419 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 394 transitions. [2025-03-09 00:26:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-09 00:26:39,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:39,420 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:39,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 00:26:39,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-09 00:26:39,621 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:39,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:39,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1353397220, now seen corresponding path program 1 times [2025-03-09 00:26:39,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:39,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7066889] [2025-03-09 00:26:39,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:39,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:39,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 00:26:39,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 00:26:39,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:39,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:40,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:40,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7066889] [2025-03-09 00:26:40,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7066889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:40,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:40,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 00:26:40,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141564968] [2025-03-09 00:26:40,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:40,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:26:40,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:40,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:26:40,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:26:40,109 INFO L87 Difference]: Start difference. First operand 329 states and 394 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:40,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:40,192 INFO L93 Difference]: Finished difference Result 376 states and 456 transitions. [2025-03-09 00:26:40,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:26:40,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2025-03-09 00:26:40,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:40,194 INFO L225 Difference]: With dead ends: 376 [2025-03-09 00:26:40,194 INFO L226 Difference]: Without dead ends: 376 [2025-03-09 00:26:40,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:26:40,194 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 41 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:40,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1288 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:40,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-09 00:26:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 333. [2025-03-09 00:26:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 269 states have (on average 1.4609665427509293) internal successors, (393), 328 states have internal predecessors, (393), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:26:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 399 transitions. [2025-03-09 00:26:40,200 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 399 transitions. Word has length 113 [2025-03-09 00:26:40,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:40,201 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 399 transitions. [2025-03-09 00:26:40,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 399 transitions. [2025-03-09 00:26:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-09 00:26:40,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:40,202 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:40,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-09 00:26:40,202 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:40,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:40,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1359338565, now seen corresponding path program 1 times [2025-03-09 00:26:40,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:40,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877943372] [2025-03-09 00:26:40,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:40,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:40,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 00:26:40,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 00:26:40,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:40,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:40,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:40,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877943372] [2025-03-09 00:26:40,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877943372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:40,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397022453] [2025-03-09 00:26:40,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:40,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:40,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:40,995 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:40,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 00:26:41,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 00:26:41,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 00:26:41,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:41,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:41,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 1558 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 00:26:41,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:41,438 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-09 00:26:41,481 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 11 [2025-03-09 00:26:41,544 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-09 00:26:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-09 00:26:41,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:41,849 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 14 treesize of output 12 [2025-03-09 00:26:41,851 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 18 treesize of output 16 [2025-03-09 00:26:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-09 00:26:41,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397022453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:41,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:41,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 25 [2025-03-09 00:26:41,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569298321] [2025-03-09 00:26:41,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:41,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 00:26:41,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:41,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 00:26:41,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2025-03-09 00:26:41,925 INFO L87 Difference]: Start difference. First operand 333 states and 399 transitions. Second operand has 26 states, 25 states have (on average 3.48) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:42,264 INFO L93 Difference]: Finished difference Result 608 states and 741 transitions. [2025-03-09 00:26:42,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:26:42,265 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.48) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2025-03-09 00:26:42,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:42,266 INFO L225 Difference]: With dead ends: 608 [2025-03-09 00:26:42,266 INFO L226 Difference]: Without dead ends: 608 [2025-03-09 00:26:42,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2025-03-09 00:26:42,267 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 946 mSDsluCounter, 3482 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 3718 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:42,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 3718 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:26:42,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-09 00:26:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 541. [2025-03-09 00:26:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 475 states have (on average 1.4905263157894737) internal successors, (708), 534 states have internal predecessors, (708), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:26:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 718 transitions. [2025-03-09 00:26:42,275 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 718 transitions. Word has length 113 [2025-03-09 00:26:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:42,275 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 718 transitions. [2025-03-09 00:26:42,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.48) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 718 transitions. [2025-03-09 00:26:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-09 00:26:42,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:42,275 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:42,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 00:26:42,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-09 00:26:42,476 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:42,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:42,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1359348463, now seen corresponding path program 1 times [2025-03-09 00:26:42,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:42,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419735949] [2025-03-09 00:26:42,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:42,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:42,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 00:26:42,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 00:26:42,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:42,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:42,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:42,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419735949] [2025-03-09 00:26:42,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419735949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:42,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:42,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:42,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632908766] [2025-03-09 00:26:42,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:42,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:42,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:42,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:42,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:42,599 INFO L87 Difference]: Start difference. First operand 541 states and 718 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:42,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:42,628 INFO L93 Difference]: Finished difference Result 540 states and 716 transitions. [2025-03-09 00:26:42,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:42,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2025-03-09 00:26:42,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:42,630 INFO L225 Difference]: With dead ends: 540 [2025-03-09 00:26:42,630 INFO L226 Difference]: Without dead ends: 540 [2025-03-09 00:26:42,632 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-09 00:26:42,632 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 174 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:42,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 242 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-09 00:26:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-03-09 00:26:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 475 states have (on average 1.4863157894736843) internal successors, (706), 533 states have internal predecessors, (706), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:26:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 716 transitions. [2025-03-09 00:26:42,643 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 716 transitions. Word has length 113 [2025-03-09 00:26:42,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:42,643 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 716 transitions. [2025-03-09 00:26:42,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 716 transitions. [2025-03-09 00:26:42,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-09 00:26:42,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:42,647 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:42,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-09 00:26:42,647 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:42,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:42,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2142949628, now seen corresponding path program 1 times [2025-03-09 00:26:42,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:42,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183454651] [2025-03-09 00:26:42,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:42,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:42,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-09 00:26:42,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-09 00:26:42,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:42,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:44,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:44,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183454651] [2025-03-09 00:26:44,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183454651] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:44,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010450332] [2025-03-09 00:26:44,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:44,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:44,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:44,495 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:44,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 00:26:44,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-09 00:26:44,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-09 00:26:44,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:44,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:44,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 00:26:44,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:44,921 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 11 [2025-03-09 00:26:44,924 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 11 [2025-03-09 00:26:44,976 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2025-03-09 00:26:44,977 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 1 case distinctions, treesize of input 27 treesize of output 15 [2025-03-09 00:26:44,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:26:44,982 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 15 [2025-03-09 00:26:45,405 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:45,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:45,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010450332] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:45,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:45,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2025-03-09 00:26:45,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573819181] [2025-03-09 00:26:45,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:45,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 00:26:45,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:45,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 00:26:45,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-09 00:26:45,756 INFO L87 Difference]: Start difference. First operand 540 states and 716 transitions. Second operand has 20 states, 20 states have (on average 3.95) internal successors, (79), 20 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:46,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:46,223 INFO L93 Difference]: Finished difference Result 532 states and 649 transitions. [2025-03-09 00:26:46,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:26:46,223 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.95) internal successors, (79), 20 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2025-03-09 00:26:46,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:46,225 INFO L225 Difference]: With dead ends: 532 [2025-03-09 00:26:46,225 INFO L226 Difference]: Without dead ends: 532 [2025-03-09 00:26:46,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2025-03-09 00:26:46,225 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 963 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:46,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 2055 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:26:46,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-09 00:26:46,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 497. [2025-03-09 00:26:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 432 states have (on average 1.4490740740740742) internal successors, (626), 490 states have internal predecessors, (626), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:26:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 636 transitions. [2025-03-09 00:26:46,235 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 636 transitions. Word has length 114 [2025-03-09 00:26:46,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:46,235 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 636 transitions. [2025-03-09 00:26:46,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.95) internal successors, (79), 20 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 636 transitions. [2025-03-09 00:26:46,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-09 00:26:46,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:46,236 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:46,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:46,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-09 00:26:46,441 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:46,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash 810177443, now seen corresponding path program 1 times [2025-03-09 00:26:46,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:46,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860374728] [2025-03-09 00:26:46,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:46,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:46,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-09 00:26:46,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-09 00:26:46,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:46,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:47,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:47,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860374728] [2025-03-09 00:26:47,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860374728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:47,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576052644] [2025-03-09 00:26:47,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:47,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:47,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:47,356 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:47,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 00:26:47,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-09 00:26:47,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-09 00:26:47,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:47,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:47,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 1560 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 00:26:47,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:47,792 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-09 00:26:47,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 00:26:47,811 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-09 00:26:47,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 00:26:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:47,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:48,072 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 14 treesize of output 12 [2025-03-09 00:26:48,074 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 18 treesize of output 16 [2025-03-09 00:26:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:48,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576052644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:48,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:48,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 16 [2025-03-09 00:26:48,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078191947] [2025-03-09 00:26:48,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:48,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 00:26:48,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:48,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 00:26:48,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-09 00:26:48,121 INFO L87 Difference]: Start difference. First operand 497 states and 636 transitions. Second operand has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:48,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:48,325 INFO L93 Difference]: Finished difference Result 537 states and 656 transitions. [2025-03-09 00:26:48,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 00:26:48,326 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2025-03-09 00:26:48,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:48,327 INFO L225 Difference]: With dead ends: 537 [2025-03-09 00:26:48,327 INFO L226 Difference]: Without dead ends: 537 [2025-03-09 00:26:48,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-03-09 00:26:48,328 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 446 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:48,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1977 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:26:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-09 00:26:48,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 498. [2025-03-09 00:26:48,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 433 states have (on average 1.4480369515011546) internal successors, (627), 491 states have internal predecessors, (627), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:26:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 637 transitions. [2025-03-09 00:26:48,337 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 637 transitions. Word has length 114 [2025-03-09 00:26:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:48,338 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 637 transitions. [2025-03-09 00:26:48,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 637 transitions. [2025-03-09 00:26:48,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-09 00:26:48,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:48,339 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:48,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 00:26:48,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-09 00:26:48,540 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:48,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash -654303047, now seen corresponding path program 1 times [2025-03-09 00:26:48,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:48,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940324610] [2025-03-09 00:26:48,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:48,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:48,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-09 00:26:48,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-09 00:26:48,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:48,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:49,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:49,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940324610] [2025-03-09 00:26:49,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940324610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:49,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770876253] [2025-03-09 00:26:49,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:49,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:49,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:49,264 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:49,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 00:26:49,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-09 00:26:49,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-09 00:26:49,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:49,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:49,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 00:26:49,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:49,700 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-09 00:26:49,717 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-09 00:26:49,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 00:26:49,752 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-09 00:26:49,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 00:26:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:49,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:49,955 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 16 treesize of output 14 [2025-03-09 00:26:49,956 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 22 treesize of output 20 [2025-03-09 00:26:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:50,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770876253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:50,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:50,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2025-03-09 00:26:50,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649431968] [2025-03-09 00:26:50,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:50,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 00:26:50,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:50,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 00:26:50,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-09 00:26:50,064 INFO L87 Difference]: Start difference. First operand 498 states and 637 transitions. Second operand has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 20 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:50,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:50,502 INFO L93 Difference]: Finished difference Result 527 states and 643 transitions. [2025-03-09 00:26:50,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:26:50,503 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 20 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2025-03-09 00:26:50,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:50,504 INFO L225 Difference]: With dead ends: 527 [2025-03-09 00:26:50,504 INFO L226 Difference]: Without dead ends: 527 [2025-03-09 00:26:50,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2025-03-09 00:26:50,505 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 322 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:50,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1630 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:26:50,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-09 00:26:50,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 499. [2025-03-09 00:26:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 434 states have (on average 1.4470046082949308) internal successors, (628), 492 states have internal predecessors, (628), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:26:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 638 transitions. [2025-03-09 00:26:50,511 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 638 transitions. Word has length 115 [2025-03-09 00:26:50,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:50,511 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 638 transitions. [2025-03-09 00:26:50,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 20 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:50,511 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 638 transitions. [2025-03-09 00:26:50,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-09 00:26:50,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:50,512 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:50,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:50,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:50,713 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:50,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:50,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2096985604, now seen corresponding path program 1 times [2025-03-09 00:26:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:50,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215140514] [2025-03-09 00:26:50,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:50,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:50,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-09 00:26:50,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-09 00:26:50,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:50,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:50,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:50,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215140514] [2025-03-09 00:26:50,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215140514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:50,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:50,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:26:50,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655097686] [2025-03-09 00:26:50,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:50,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:26:50,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:50,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:26:50,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:50,923 INFO L87 Difference]: Start difference. First operand 499 states and 638 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:50,939 INFO L93 Difference]: Finished difference Result 497 states and 629 transitions. [2025-03-09 00:26:50,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:26:50,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2025-03-09 00:26:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:50,941 INFO L225 Difference]: With dead ends: 497 [2025-03-09 00:26:50,941 INFO L226 Difference]: Without dead ends: 497 [2025-03-09 00:26:50,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:50,942 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:50,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 679 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:50,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-09 00:26:50,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2025-03-09 00:26:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 432 states have (on average 1.4328703703703705) internal successors, (619), 490 states have internal predecessors, (619), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:26:50,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 629 transitions. [2025-03-09 00:26:50,952 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 629 transitions. Word has length 116 [2025-03-09 00:26:50,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:50,952 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 629 transitions. [2025-03-09 00:26:50,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:50,952 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 629 transitions. [2025-03-09 00:26:50,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-09 00:26:50,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:50,953 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:50,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-09 00:26:50,953 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:50,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:50,954 INFO L85 PathProgramCache]: Analyzing trace with hash 896561762, now seen corresponding path program 1 times [2025-03-09 00:26:50,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:50,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400050905] [2025-03-09 00:26:50,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:50,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:50,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-09 00:26:51,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-09 00:26:51,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:51,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:51,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:51,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400050905] [2025-03-09 00:26:51,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400050905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:51,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:51,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:51,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745722852] [2025-03-09 00:26:51,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:51,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:51,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:51,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:51,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:51,082 INFO L87 Difference]: Start difference. First operand 497 states and 629 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:51,112 INFO L93 Difference]: Finished difference Result 496 states and 628 transitions. [2025-03-09 00:26:51,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:51,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2025-03-09 00:26:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:51,114 INFO L225 Difference]: With dead ends: 496 [2025-03-09 00:26:51,114 INFO L226 Difference]: Without dead ends: 496 [2025-03-09 00:26:51,114 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-09 00:26:51,114 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 177 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:51,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 235 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-09 00:26:51,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-03-09 00:26:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 432 states have (on average 1.4305555555555556) internal successors, (618), 489 states have internal predecessors, (618), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:26:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 628 transitions. [2025-03-09 00:26:51,120 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 628 transitions. Word has length 116 [2025-03-09 00:26:51,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:51,120 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 628 transitions. [2025-03-09 00:26:51,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:51,120 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 628 transitions. [2025-03-09 00:26:51,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-09 00:26:51,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:51,121 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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] [2025-03-09 00:26:51,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-09 00:26:51,121 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:51,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:51,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1720002794, now seen corresponding path program 1 times [2025-03-09 00:26:51,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:51,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594253771] [2025-03-09 00:26:51,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:51,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:51,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-09 00:26:51,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-09 00:26:51,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:51,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:51,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:51,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594253771] [2025-03-09 00:26:51,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594253771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:51,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299760184] [2025-03-09 00:26:51,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:51,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:51,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:51,354 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:51,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 00:26:51,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-09 00:26:51,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-09 00:26:51,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:51,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:51,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 1568 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:26:51,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:51,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:51,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299760184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:51,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:51,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-09 00:26:51,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522374826] [2025-03-09 00:26:51,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:51,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:26:51,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:51,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:26:51,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:26:51,934 INFO L87 Difference]: Start difference. First operand 496 states and 628 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:52,007 INFO L93 Difference]: Finished difference Result 576 states and 689 transitions. [2025-03-09 00:26:52,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:26:52,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2025-03-09 00:26:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:52,009 INFO L225 Difference]: With dead ends: 576 [2025-03-09 00:26:52,009 INFO L226 Difference]: Without dead ends: 576 [2025-03-09 00:26:52,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 227 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:26:52,010 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 96 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:52,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1840 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:52,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-09 00:26:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 497. [2025-03-09 00:26:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 433 states have (on average 1.4295612009237875) internal successors, (619), 490 states have internal predecessors, (619), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:26:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 629 transitions. [2025-03-09 00:26:52,016 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 629 transitions. Word has length 117 [2025-03-09 00:26:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:52,016 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 629 transitions. [2025-03-09 00:26:52,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 629 transitions. [2025-03-09 00:26:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-09 00:26:52,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:52,017 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:52,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 00:26:52,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-09 00:26:52,218 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:52,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:52,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2023610829, now seen corresponding path program 1 times [2025-03-09 00:26:52,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:52,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945663530] [2025-03-09 00:26:52,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:52,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:52,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-09 00:26:52,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-09 00:26:52,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:52,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:52,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:52,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945663530] [2025-03-09 00:26:52,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945663530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:52,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689842365] [2025-03-09 00:26:52,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:52,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:52,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:52,496 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:52,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 00:26:52,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-09 00:26:52,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-09 00:26:52,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:52,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:52,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 1561 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:26:52,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:53,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:53,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689842365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:53,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:53,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-09 00:26:53,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114079217] [2025-03-09 00:26:53,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:53,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 00:26:53,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:53,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 00:26:53,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:26:53,110 INFO L87 Difference]: Start difference. First operand 497 states and 629 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:53,168 INFO L93 Difference]: Finished difference Result 500 states and 628 transitions. [2025-03-09 00:26:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:26:53,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2025-03-09 00:26:53,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:53,170 INFO L225 Difference]: With dead ends: 500 [2025-03-09 00:26:53,170 INFO L226 Difference]: Without dead ends: 500 [2025-03-09 00:26:53,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:26:53,170 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 205 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:53,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1279 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:53,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-09 00:26:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2025-03-09 00:26:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 430 states have (on average 1.4232558139534883) internal successors, (612), 487 states have internal predecessors, (612), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:26:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 622 transitions. [2025-03-09 00:26:53,179 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 622 transitions. Word has length 117 [2025-03-09 00:26:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:53,179 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 622 transitions. [2025-03-09 00:26:53,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 622 transitions. [2025-03-09 00:26:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-09 00:26:53,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:53,180 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:53,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-09 00:26:53,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-09 00:26:53,381 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:53,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:53,381 INFO L85 PathProgramCache]: Analyzing trace with hash 863526967, now seen corresponding path program 1 times [2025-03-09 00:26:53,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:53,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381446800] [2025-03-09 00:26:53,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:53,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:53,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-09 00:26:53,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 00:26:53,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:53,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:53,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:53,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381446800] [2025-03-09 00:26:53,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381446800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:53,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:53,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:53,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865367477] [2025-03-09 00:26:53,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:53,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:53,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:53,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:53,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:53,624 INFO L87 Difference]: Start difference. First operand 494 states and 622 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:53,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:53,723 INFO L93 Difference]: Finished difference Result 493 states and 620 transitions. [2025-03-09 00:26:53,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:53,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2025-03-09 00:26:53,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:53,726 INFO L225 Difference]: With dead ends: 493 [2025-03-09 00:26:53,726 INFO L226 Difference]: Without dead ends: 493 [2025-03-09 00:26:53,726 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-09 00:26:53,726 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:53,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 383 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:53,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-09 00:26:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2025-03-09 00:26:53,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 430 states have (on average 1.4186046511627908) internal successors, (610), 486 states have internal predecessors, (610), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:26:53,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 620 transitions. [2025-03-09 00:26:53,733 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 620 transitions. Word has length 118 [2025-03-09 00:26:53,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:53,734 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 620 transitions. [2025-03-09 00:26:53,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:53,734 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 620 transitions. [2025-03-09 00:26:53,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-09 00:26:53,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:53,735 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:53,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-09 00:26:53,735 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:53,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:53,736 INFO L85 PathProgramCache]: Analyzing trace with hash 863526966, now seen corresponding path program 1 times [2025-03-09 00:26:53,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:53,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166327770] [2025-03-09 00:26:53,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:53,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:53,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-09 00:26:53,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 00:26:53,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:53,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:53,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:53,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166327770] [2025-03-09 00:26:53,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166327770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:53,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:53,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:53,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720697466] [2025-03-09 00:26:53,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:53,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:53,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:53,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:53,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:53,945 INFO L87 Difference]: Start difference. First operand 493 states and 620 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:54,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:54,012 INFO L93 Difference]: Finished difference Result 492 states and 618 transitions. [2025-03-09 00:26:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:54,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2025-03-09 00:26:54,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:54,014 INFO L225 Difference]: With dead ends: 492 [2025-03-09 00:26:54,014 INFO L226 Difference]: Without dead ends: 492 [2025-03-09 00:26:54,014 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-09 00:26:54,015 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 1 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:54,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 378 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:54,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-09 00:26:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2025-03-09 00:26:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 430 states have (on average 1.413953488372093) internal successors, (608), 485 states have internal predecessors, (608), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:26:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 618 transitions. [2025-03-09 00:26:54,020 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 618 transitions. Word has length 118 [2025-03-09 00:26:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:54,020 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 618 transitions. [2025-03-09 00:26:54,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 618 transitions. [2025-03-09 00:26:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-09 00:26:54,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:54,021 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:54,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-09 00:26:54,021 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:54,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:54,021 INFO L85 PathProgramCache]: Analyzing trace with hash 639417077, now seen corresponding path program 1 times [2025-03-09 00:26:54,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:54,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119567689] [2025-03-09 00:26:54,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:54,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:54,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-09 00:26:54,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-09 00:26:54,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:54,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:54,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:54,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119567689] [2025-03-09 00:26:54,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119567689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:54,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512492907] [2025-03-09 00:26:54,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:54,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:54,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:54,994 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:54,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 00:26:55,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-09 00:26:55,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-09 00:26:55,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:55,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:55,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 1572 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 00:26:55,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:55,458 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-09 00:26:55,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-03-09 00:26:55,478 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:26:55,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:26:55,487 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-09 00:26:55,498 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 16 treesize of output 8 [2025-03-09 00:26:55,506 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-09 00:26:55,708 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 16 treesize of output 8 [2025-03-09 00:26:55,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 00:26:55,726 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:55,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:26:55,907 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 6 treesize of output 4 [2025-03-09 00:26:55,909 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 15 treesize of output 13 [2025-03-09 00:26:55,910 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 20 treesize of output 18 [2025-03-09 00:26:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:56,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512492907] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:26:56,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:26:56,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2025-03-09 00:26:56,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770533408] [2025-03-09 00:26:56,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:26:56,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 00:26:56,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:56,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 00:26:56,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-03-09 00:26:56,003 INFO L87 Difference]: Start difference. First operand 492 states and 618 transitions. Second operand has 20 states, 19 states have (on average 4.578947368421052) internal successors, (87), 20 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:56,420 INFO L93 Difference]: Finished difference Result 522 states and 631 transitions. [2025-03-09 00:26:56,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:26:56,421 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.578947368421052) internal successors, (87), 20 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2025-03-09 00:26:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:56,422 INFO L225 Difference]: With dead ends: 522 [2025-03-09 00:26:56,422 INFO L226 Difference]: Without dead ends: 522 [2025-03-09 00:26:56,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2025-03-09 00:26:56,423 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 855 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:56,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1723 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:26:56,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-09 00:26:56,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 495. [2025-03-09 00:26:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 433 states have (on average 1.4110854503464203) internal successors, (611), 488 states have internal predecessors, (611), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:26:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 621 transitions. [2025-03-09 00:26:56,428 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 621 transitions. Word has length 119 [2025-03-09 00:26:56,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:56,428 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 621 transitions. [2025-03-09 00:26:56,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.578947368421052) internal successors, (87), 20 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:56,428 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 621 transitions. [2025-03-09 00:26:56,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-09 00:26:56,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:56,428 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:56,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 00:26:56,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:56,629 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:56,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:56,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1525920287, now seen corresponding path program 1 times [2025-03-09 00:26:56,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:56,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636606502] [2025-03-09 00:26:56,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:56,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:56,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-09 00:26:56,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-09 00:26:56,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:56,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:56,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:56,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636606502] [2025-03-09 00:26:56,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636606502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:56,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:56,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:26:56,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495327747] [2025-03-09 00:26:56,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:56,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:26:56,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:56,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:26:56,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:56,801 INFO L87 Difference]: Start difference. First operand 495 states and 621 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:56,815 INFO L93 Difference]: Finished difference Result 493 states and 613 transitions. [2025-03-09 00:26:56,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:26:56,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2025-03-09 00:26:56,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:56,817 INFO L225 Difference]: With dead ends: 493 [2025-03-09 00:26:56,817 INFO L226 Difference]: Without dead ends: 493 [2025-03-09 00:26:56,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:26:56,817 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 2 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:56,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 665 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:26:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-09 00:26:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 487. [2025-03-09 00:26:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 425 states have (on average 1.4) internal successors, (595), 480 states have internal predecessors, (595), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:26:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 605 transitions. [2025-03-09 00:26:56,822 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 605 transitions. Word has length 121 [2025-03-09 00:26:56,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:56,823 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 605 transitions. [2025-03-09 00:26:56,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 605 transitions. [2025-03-09 00:26:56,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-09 00:26:56,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:56,823 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:56,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-09 00:26:56,824 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:56,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash 57505969, now seen corresponding path program 1 times [2025-03-09 00:26:56,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:56,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435142220] [2025-03-09 00:26:56,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:56,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:56,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-09 00:26:56,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 00:26:56,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:56,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 00:26:57,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:57,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435142220] [2025-03-09 00:26:57,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435142220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:57,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:57,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 00:26:57,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109485569] [2025-03-09 00:26:57,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:57,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:26:57,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:57,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:26:57,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:26:57,119 INFO L87 Difference]: Start difference. First operand 487 states and 605 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:57,208 INFO L93 Difference]: Finished difference Result 505 states and 626 transitions. [2025-03-09 00:26:57,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:26:57,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2025-03-09 00:26:57,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:57,210 INFO L225 Difference]: With dead ends: 505 [2025-03-09 00:26:57,210 INFO L226 Difference]: Without dead ends: 505 [2025-03-09 00:26:57,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:26:57,211 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 19 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:57,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1249 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:26:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-09 00:26:57,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 494. [2025-03-09 00:26:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 432 states have (on average 1.3912037037037037) internal successors, (601), 487 states have internal predecessors, (601), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:26:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 611 transitions. [2025-03-09 00:26:57,217 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 611 transitions. Word has length 122 [2025-03-09 00:26:57,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:57,218 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 611 transitions. [2025-03-09 00:26:57,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:26:57,218 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 611 transitions. [2025-03-09 00:26:57,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-09 00:26:57,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:57,218 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:57,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-09 00:26:57,219 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:26:57,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:57,219 INFO L85 PathProgramCache]: Analyzing trace with hash 694170172, now seen corresponding path program 1 times [2025-03-09 00:26:57,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:57,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80483231] [2025-03-09 00:26:57,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:57,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:57,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-09 00:26:57,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 00:26:57,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:57,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:26:58,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:58,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80483231] [2025-03-09 00:26:58,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80483231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:26:58,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448590028] [2025-03-09 00:26:58,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:58,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:26:58,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:58,879 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:26:58,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 00:26:59,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-09 00:26:59,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 00:26:59,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:59,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:59,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-09 00:26:59,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:26:59,386 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 10 treesize of output 8 [2025-03-09 00:26:59,436 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-09 00:26:59,471 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-09 00:26:59,517 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 9 [2025-03-09 00:26:59,554 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-09 00:27:00,062 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-09 00:27:00,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-09 00:27:00,153 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 16 treesize of output 8 [2025-03-09 00:27:00,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-09 00:27:00,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 00:27:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:27:00,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:00,785 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 15 treesize of output 13 [2025-03-09 00:27:00,788 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 20 treesize of output 18 [2025-03-09 00:27:00,858 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 6 treesize of output 4 [2025-03-09 00:27:00,889 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 22 treesize of output 20 [2025-03-09 00:27:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:27:00,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448590028] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:00,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:00,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 36 [2025-03-09 00:27:00,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426756018] [2025-03-09 00:27:00,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:00,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-09 00:27:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:00,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-09 00:27:00,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1165, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 00:27:00,943 INFO L87 Difference]: Start difference. First operand 494 states and 611 transitions. Second operand has 37 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 37 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:27:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:02,416 INFO L93 Difference]: Finished difference Result 565 states and 657 transitions. [2025-03-09 00:27:02,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-09 00:27:02,417 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 37 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 122 [2025-03-09 00:27:02,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:02,418 INFO L225 Difference]: With dead ends: 565 [2025-03-09 00:27:02,418 INFO L226 Difference]: Without dead ends: 565 [2025-03-09 00:27:02,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=484, Invalid=2378, Unknown=0, NotChecked=0, Total=2862 [2025-03-09 00:27:02,420 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1763 mSDsluCounter, 2991 mSDsCounter, 0 mSdLazyCounter, 2633 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1763 SdHoareTripleChecker+Valid, 3157 SdHoareTripleChecker+Invalid, 2662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:02,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1763 Valid, 3157 Invalid, 2662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2633 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 00:27:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-09 00:27:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 497. [2025-03-09 00:27:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 435 states have (on average 1.3885057471264368) internal successors, (604), 490 states have internal predecessors, (604), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:27:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 614 transitions. [2025-03-09 00:27:02,425 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 614 transitions. Word has length 122 [2025-03-09 00:27:02,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:02,425 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 614 transitions. [2025-03-09 00:27:02,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 37 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:27:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 614 transitions. [2025-03-09 00:27:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-09 00:27:02,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:02,426 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:02,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-09 00:27:02,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:02,626 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:27:02,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:02,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1833241129, now seen corresponding path program 1 times [2025-03-09 00:27:02,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:02,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491737818] [2025-03-09 00:27:02,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:02,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:02,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-09 00:27:02,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 00:27:02,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:02,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:27:02,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:02,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491737818] [2025-03-09 00:27:02,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491737818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:02,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305061372] [2025-03-09 00:27:02,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:02,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:02,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:02,963 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:02,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-09 00:27:03,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-09 00:27:03,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 00:27:03,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:03,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:03,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 1628 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 00:27:03,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:27:03,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:27:03,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305061372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:03,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:03,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-09 00:27:03,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489057318] [2025-03-09 00:27:03,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:03,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 00:27:03,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:03,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 00:27:03,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:27:03,815 INFO L87 Difference]: Start difference. First operand 497 states and 614 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:03,877 INFO L93 Difference]: Finished difference Result 468 states and 532 transitions. [2025-03-09 00:27:03,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:27:03,878 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2025-03-09 00:27:03,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:03,879 INFO L225 Difference]: With dead ends: 468 [2025-03-09 00:27:03,879 INFO L226 Difference]: Without dead ends: 468 [2025-03-09 00:27:03,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:27:03,879 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 45 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:03,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1292 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-09 00:27:03,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 409. [2025-03-09 00:27:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 349 states have (on average 1.335243553008596) internal successors, (466), 404 states have internal predecessors, (466), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:27:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 472 transitions. [2025-03-09 00:27:03,883 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 472 transitions. Word has length 123 [2025-03-09 00:27:03,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:03,883 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 472 transitions. [2025-03-09 00:27:03,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:03,883 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 472 transitions. [2025-03-09 00:27:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-09 00:27:03,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:03,884 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:03,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-09 00:27:04,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:04,085 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:27:04,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:04,085 INFO L85 PathProgramCache]: Analyzing trace with hash 44438833, now seen corresponding path program 1 times [2025-03-09 00:27:04,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:04,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567139893] [2025-03-09 00:27:04,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:04,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:04,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-09 00:27:04,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 00:27:04,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:04,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-09 00:27:04,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:04,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567139893] [2025-03-09 00:27:04,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567139893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:04,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:04,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:27:04,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757595366] [2025-03-09 00:27:04,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:04,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:27:04,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:04,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:27:04,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:04,239 INFO L87 Difference]: Start difference. First operand 409 states and 472 transitions. Second operand has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:04,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:04,245 INFO L93 Difference]: Finished difference Result 408 states and 471 transitions. [2025-03-09 00:27:04,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:04,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2025-03-09 00:27:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:04,247 INFO L225 Difference]: With dead ends: 408 [2025-03-09 00:27:04,247 INFO L226 Difference]: Without dead ends: 408 [2025-03-09 00:27:04,247 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-09 00:27:04,247 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 170 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:04,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 235 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:04,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-09 00:27:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-03-09 00:27:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 349 states have (on average 1.332378223495702) internal successors, (465), 403 states have internal predecessors, (465), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:27:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 471 transitions. [2025-03-09 00:27:04,251 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 471 transitions. Word has length 123 [2025-03-09 00:27:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:04,251 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 471 transitions. [2025-03-09 00:27:04,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 471 transitions. [2025-03-09 00:27:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-09 00:27:04,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:04,252 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:04,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-09 00:27:04,252 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:27:04,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:04,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1377603802, now seen corresponding path program 1 times [2025-03-09 00:27:04,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:04,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180867684] [2025-03-09 00:27:04,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:04,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:04,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-09 00:27:04,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-09 00:27:04,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:04,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:04,398 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-09 00:27:04,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:04,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180867684] [2025-03-09 00:27:04,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180867684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:04,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:04,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:27:04,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234846608] [2025-03-09 00:27:04,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:04,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:27:04,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:04,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:27:04,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:04,399 INFO L87 Difference]: Start difference. First operand 408 states and 471 transitions. Second operand has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:04,432 INFO L93 Difference]: Finished difference Result 407 states and 470 transitions. [2025-03-09 00:27:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:04,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2025-03-09 00:27:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:04,435 INFO L225 Difference]: With dead ends: 407 [2025-03-09 00:27:04,435 INFO L226 Difference]: Without dead ends: 407 [2025-03-09 00:27:04,435 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-09 00:27:04,435 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 171 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:04,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 218 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:04,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-09 00:27:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2025-03-09 00:27:04,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 349 states have (on average 1.329512893982808) internal successors, (464), 402 states have internal predecessors, (464), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:27:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 470 transitions. [2025-03-09 00:27:04,440 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 470 transitions. Word has length 124 [2025-03-09 00:27:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:04,440 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 470 transitions. [2025-03-09 00:27:04,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 470 transitions. [2025-03-09 00:27:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-09 00:27:04,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:04,441 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:04,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-09 00:27:04,441 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:27:04,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash -243955121, now seen corresponding path program 1 times [2025-03-09 00:27:04,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:04,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529959170] [2025-03-09 00:27:04,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:04,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:04,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-09 00:27:04,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-09 00:27:04,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:04,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:27:05,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:05,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529959170] [2025-03-09 00:27:05,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529959170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:05,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623292442] [2025-03-09 00:27:05,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:05,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:05,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:05,766 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:05,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-09 00:27:06,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-09 00:27:06,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-09 00:27:06,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:06,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:06,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 1586 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-09 00:27:06,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:06,287 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-09 00:27:06,391 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 00:27:06,408 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2025-03-09 00:27:06,408 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 27 treesize of output 38 [2025-03-09 00:27:06,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:27:06,458 INFO L349 Elim1Store]: treesize reduction 92, result has 22.7 percent of original size [2025-03-09 00:27:06,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 34 treesize of output 39 [2025-03-09 00:27:06,639 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-09 00:27:06,681 INFO L349 Elim1Store]: treesize reduction 68, result has 39.3 percent of original size [2025-03-09 00:27:06,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 93 [2025-03-09 00:27:06,854 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-09 00:27:07,136 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 11 [2025-03-09 00:27:09,134 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 99 treesize of output 79 [2025-03-09 00:27:10,228 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-09 00:27:10,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-09 00:27:10,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 74 [2025-03-09 00:27:10,656 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2025-03-09 00:27:10,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 78 [2025-03-09 00:27:10,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-09 00:27:10,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 00:27:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-03-09 00:27:10,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:11,398 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 19 treesize of output 17 [2025-03-09 00:27:11,404 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 28 treesize of output 26 [2025-03-09 00:27:11,655 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 22 treesize of output 20 [2025-03-09 00:27:12,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623292442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:12,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:27:12,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 29 [2025-03-09 00:27:12,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548771209] [2025-03-09 00:27:12,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:12,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-09 00:27:12,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:12,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-09 00:27:12,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=1396, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 00:27:12,545 INFO L87 Difference]: Start difference. First operand 407 states and 470 transitions. Second operand has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 28 states have internal predecessors, (90), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:27:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:14,138 INFO L93 Difference]: Finished difference Result 421 states and 483 transitions. [2025-03-09 00:27:14,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-09 00:27:14,139 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 28 states have internal predecessors, (90), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 125 [2025-03-09 00:27:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:14,140 INFO L225 Difference]: With dead ends: 421 [2025-03-09 00:27:14,140 INFO L226 Difference]: Without dead ends: 421 [2025-03-09 00:27:14,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 179 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=536, Invalid=1816, Unknown=0, NotChecked=0, Total=2352 [2025-03-09 00:27:14,141 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 421 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:14,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1259 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 00:27:14,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-09 00:27:14,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 410. [2025-03-09 00:27:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 352 states have (on average 1.3267045454545454) internal successors, (467), 405 states have internal predecessors, (467), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 00:27:14,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 473 transitions. [2025-03-09 00:27:14,146 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 473 transitions. Word has length 125 [2025-03-09 00:27:14,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:14,146 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 473 transitions. [2025-03-09 00:27:14,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 28 states have internal predecessors, (90), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:27:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 473 transitions. [2025-03-09 00:27:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-09 00:27:14,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:14,146 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:14,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-09 00:27:14,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-03-09 00:27:14,347 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-09 00:27:14,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:14,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1027325815, now seen corresponding path program 1 times [2025-03-09 00:27:14,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:14,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825889209] [2025-03-09 00:27:14,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:14,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:14,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-09 00:27:14,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-09 00:27:14,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:14,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:27:17,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:17,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825889209] [2025-03-09 00:27:17,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825889209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:17,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079602565] [2025-03-09 00:27:17,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:17,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:17,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:17,750 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:17,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-09 00:27:18,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-09 00:27:18,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-09 00:27:18,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:18,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:18,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 1591 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-09 00:27:18,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:18,410 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 0 case distinctions, treesize of input 14 treesize of output 3 [2025-03-09 00:27:18,804 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-09 00:27:19,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 15 treesize of output 1 [2025-03-09 00:27:20,234 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 11