./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/dirname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/dirname-1.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 deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:13:38,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:13:38,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 09:13:38,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:13:38,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:13:38,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:13:38,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:13:38,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:13:38,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:13:38,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:13:38,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:13:38,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:13:38,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:13:38,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:13:38,775 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:13:38,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:13:38,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:13:38,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:13:38,775 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:13:38,775 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:13:38,775 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:13:38,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:13:38,775 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:13:38,775 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:13:38,775 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:13:38,775 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:13:38,775 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:13:38,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:13:38,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:13:38,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:13:38,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:13:38,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:13:38,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:13:38,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:13:38,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:13:38,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:13:38,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:13:38,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:13:38,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:13:38,776 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 -> deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 [2025-03-04 09:13:38,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:13:39,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:13:39,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:13:39,009 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:13:39,009 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:13:39,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2025-03-04 09:13:40,184 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daed244f7/636cd542272b467d99b8465a3e40456d/FLAG451127fab [2025-03-04 09:13:40,479 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:13:40,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2025-03-04 09:13:40,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daed244f7/636cd542272b467d99b8465a3e40456d/FLAG451127fab [2025-03-04 09:13:40,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daed244f7/636cd542272b467d99b8465a3e40456d [2025-03-04 09:13:40,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:13:40,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:13:40,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:13:40,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:13:40,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:13:40,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:13:40" (1/1) ... [2025-03-04 09:13:40,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b84aff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:40, skipping insertion in model container [2025-03-04 09:13:40,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:13:40" (1/1) ... [2025-03-04 09:13:40,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:13:41,122 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:41,134 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:41,135 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:41,146 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:41,154 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:41,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:13:41,198 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:13:41,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:13:41,323 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:13:41,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:41 WrapperNode [2025-03-04 09:13:41,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:13:41,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:13:41,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:13:41,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:13:41,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:41" (1/1) ... [2025-03-04 09:13:41,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:41" (1/1) ... [2025-03-04 09:13:41,403 INFO L138 Inliner]: procedures = 344, calls = 498, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 648 [2025-03-04 09:13:41,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:13:41,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:13:41,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:13:41,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:13:41,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:41" (1/1) ... [2025-03-04 09:13:41,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:41" (1/1) ... [2025-03-04 09:13:41,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:41" (1/1) ... [2025-03-04 09:13:41,449 INFO L175 MemorySlicer]: Split 450 memory accesses to 15 slices as follows [2, 3, 3, 3, 4, 4, 4, 4, 3, 44, 355, 2, 11, 6, 2]. 79 percent of accesses are in the largest equivalence class. The 423 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 3, 42, 355, 0, 0, 0, 0]. The 9 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 1, 2, 2, 2]. [2025-03-04 09:13:41,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:41" (1/1) ... [2025-03-04 09:13:41,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:41" (1/1) ... [2025-03-04 09:13:41,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:41" (1/1) ... [2025-03-04 09:13:41,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:41" (1/1) ... [2025-03-04 09:13:41,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:41" (1/1) ... [2025-03-04 09:13:41,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:41" (1/1) ... [2025-03-04 09:13:41,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:13:41,509 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:13:41,509 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:13:41,509 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:13:41,510 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:41" (1/1) ... [2025-03-04 09:13:41,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:13:41,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:41,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:13:41,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:13:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 09:13:41,564 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 09:13:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 09:13:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 09:13:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 09:13:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 09:13:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 09:13:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 09:13:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 09:13:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 09:13:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 09:13:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 09:13:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 09:13:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 09:13:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 09:13:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 09:13:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 09:13:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:13:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:13:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:13:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:13:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 09:13:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 09:13:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 09:13:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 09:13:41,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 09:13:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 09:13:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:13:41,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:13:41,734 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:13:41,735 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:13:42,266 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1231: havoc single_argv_#t~mem89#1.base, single_argv_#t~mem89#1.offset; [2025-03-04 09:13:42,295 INFO L? ?]: Removed 163 outVars from TransFormulas that were not future-live. [2025-03-04 09:13:42,295 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:13:42,307 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:13:42,308 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:13:42,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:13:42 BoogieIcfgContainer [2025-03-04 09:13:42,308 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:13:42,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:13:42,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:13:42,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:13:42,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:13:40" (1/3) ... [2025-03-04 09:13:42,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735fb58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:13:42, skipping insertion in model container [2025-03-04 09:13:42,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:41" (2/3) ... [2025-03-04 09:13:42,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735fb58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:13:42, skipping insertion in model container [2025-03-04 09:13:42,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:13:42" (3/3) ... [2025-03-04 09:13:42,317 INFO L128 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2025-03-04 09:13:42,328 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:13:42,329 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dirname-1.i that has 2 procedures, 176 locations, 1 initial locations, 6 loop locations, and 74 error locations. [2025-03-04 09:13:42,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:13:42,378 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;@6f5bc479, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:13:42,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-03-04 09:13:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 99 states have (on average 1.9494949494949494) internal successors, (193), 173 states have internal predecessors, (193), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:42,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:13:42,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:42,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:13:42,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:42,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:42,391 INFO L85 PathProgramCache]: Analyzing trace with hash 227364, now seen corresponding path program 1 times [2025-03-04 09:13:42,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:42,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101162119] [2025-03-04 09:13:42,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:42,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:42,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:13:42,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:13:42,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:42,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:42,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:42,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:42,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101162119] [2025-03-04 09:13:42,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101162119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:42,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:42,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:13:42,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626897646] [2025-03-04 09:13:42,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:42,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:13:42,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:42,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:13:42,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:42,869 INFO L87 Difference]: Start difference. First operand has 176 states, 99 states have (on average 1.9494949494949494) internal successors, (193), 173 states have internal predecessors, (193), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:43,002 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2025-03-04 09:13:43,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:43,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:13:43,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:43,009 INFO L225 Difference]: With dead ends: 136 [2025-03-04 09:13:43,009 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 09:13:43,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:43,013 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 139 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:43,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 94 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:13:43,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 09:13:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-04 09:13:43,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 79 states have (on average 1.8734177215189873) internal successors, (148), 133 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2025-03-04 09:13:43,048 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 3 [2025-03-04 09:13:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:43,049 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2025-03-04 09:13:43,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2025-03-04 09:13:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:13:43,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:43,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:13:43,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:13:43,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:43,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:43,052 INFO L85 PathProgramCache]: Analyzing trace with hash 227365, now seen corresponding path program 1 times [2025-03-04 09:13:43,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:43,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607428175] [2025-03-04 09:13:43,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:43,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:43,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:13:43,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:13:43,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:43,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:43,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:43,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607428175] [2025-03-04 09:13:43,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607428175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:43,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:43,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:13:43,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502944178] [2025-03-04 09:13:43,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:43,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:13:43,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:43,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:13:43,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:43,333 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:43,430 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2025-03-04 09:13:43,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:43,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:13:43,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:43,431 INFO L225 Difference]: With dead ends: 135 [2025-03-04 09:13:43,433 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 09:13:43,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:43,433 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:43,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 228 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:13:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 09:13:43,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-04 09:13:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 79 states have (on average 1.860759493670886) internal successors, (147), 132 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2025-03-04 09:13:43,438 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 3 [2025-03-04 09:13:43,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:43,438 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2025-03-04 09:13:43,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2025-03-04 09:13:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 09:13:43,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:43,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:13:43,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:13:43,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:43,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:43,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1816370850, now seen corresponding path program 1 times [2025-03-04 09:13:43,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:43,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455409428] [2025-03-04 09:13:43,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:43,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:43,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:13:43,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:13:43,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:43,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:43,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:43,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455409428] [2025-03-04 09:13:43,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455409428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:43,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:43,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:13:43,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806443068] [2025-03-04 09:13:43,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:43,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:13:43,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:43,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:13:43,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:13:43,703 INFO L87 Difference]: Start difference. First operand 135 states and 149 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-04 09:13:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:43,816 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2025-03-04 09:13:43,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:13:43,816 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-04 09:13:43,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:43,820 INFO L225 Difference]: With dead ends: 138 [2025-03-04 09:13:43,821 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 09:13:43,821 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-04 09:13:43,823 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 7 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:43,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 226 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:13:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 09:13:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2025-03-04 09:13:43,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 81 states have (on average 1.8395061728395061) internal successors, (149), 134 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2025-03-04 09:13:43,833 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 6 [2025-03-04 09:13:43,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:43,833 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2025-03-04 09:13:43,834 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-04 09:13:43,834 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2025-03-04 09:13:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:13:43,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:43,834 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:43,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:13:43,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:43,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash 789098176, now seen corresponding path program 1 times [2025-03-04 09:13:43,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:43,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319729730] [2025-03-04 09:13:43,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:43,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:13:43,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:13:43,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:43,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:44,094 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-04 09:13:44,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:44,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319729730] [2025-03-04 09:13:44,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319729730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:13:44,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680709381] [2025-03-04 09:13:44,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:44,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:44,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:44,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:13:44,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:13:44,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:13:44,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:13:44,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:44,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:44,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:13:44,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:13:44,403 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-04 09:13:44,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:13:44,496 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-04 09:13:44,507 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-04 09:13:44,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680709381] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:13:44,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:13:44,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-04 09:13:44,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730138351] [2025-03-04 09:13:44,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:13:44,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:13:44,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:44,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:13:44,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:13:44,509 INFO L87 Difference]: Start difference. First operand 137 states and 151 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-04 09:13:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:44,809 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2025-03-04 09:13:44,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:13:44,809 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-04 09:13:44,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:44,810 INFO L225 Difference]: With dead ends: 141 [2025-03-04 09:13:44,810 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 09:13:44,811 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-04 09:13:44,812 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 283 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:44,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 642 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 09:13:44,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 09:13:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-04 09:13:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.7790697674418605) internal successors, (153), 138 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2025-03-04 09:13:44,822 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 9 [2025-03-04 09:13:44,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:44,822 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2025-03-04 09:13:44,823 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-04 09:13:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2025-03-04 09:13:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 09:13:44,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:44,823 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:44,832 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-04 09:13:45,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:45,024 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:45,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:45,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2146038354, now seen corresponding path program 1 times [2025-03-04 09:13:45,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:45,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980305592] [2025-03-04 09:13:45,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:45,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:45,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 09:13:45,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 09:13:45,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:45,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:45,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:45,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:45,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980305592] [2025-03-04 09:13:45,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980305592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:13:45,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488607110] [2025-03-04 09:13:45,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:45,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:45,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:45,214 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:13:45,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:13:45,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 09:13:45,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 09:13:45,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:45,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:45,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:13:45,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:13:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:45,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:13:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:45,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488607110] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:13:45,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:13:45,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 09:13:45,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513676085] [2025-03-04 09:13:45,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:13:45,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:13:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:45,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:13:45,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:13:45,504 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 09:13:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:45,539 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2025-03-04 09:13:45,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:13:45,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-04 09:13:45,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:45,540 INFO L225 Difference]: With dead ends: 156 [2025-03-04 09:13:45,540 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 09:13:45,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:13:45,541 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 4 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:45,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 571 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:13:45,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 09:13:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-04 09:13:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 101 states have (on average 1.6633663366336633) internal successors, (168), 153 states have internal predecessors, (168), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2025-03-04 09:13:45,549 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 21 [2025-03-04 09:13:45,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:45,549 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2025-03-04 09:13:45,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 09:13:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2025-03-04 09:13:45,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 09:13:45,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:45,549 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:45,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:13:45,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:45,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:45,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:45,754 INFO L85 PathProgramCache]: Analyzing trace with hash 965205552, now seen corresponding path program 2 times [2025-03-04 09:13:45,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:45,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025054738] [2025-03-04 09:13:45,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:13:45,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:45,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 09:13:45,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 36 statements. [2025-03-04 09:13:45,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:13:45,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 09:13:45,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:45,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025054738] [2025-03-04 09:13:45,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025054738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:45,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:45,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:13:45,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576404747] [2025-03-04 09:13:45,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:45,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:13:45,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:45,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:13:45,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:45,908 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:45,995 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2025-03-04 09:13:45,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:45,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 36 [2025-03-04 09:13:45,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:46,000 INFO L225 Difference]: With dead ends: 151 [2025-03-04 09:13:46,000 INFO L226 Difference]: Without dead ends: 151 [2025-03-04 09:13:46,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:46,001 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 123 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:46,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 98 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:13:46,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-04 09:13:46,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-04 09:13:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 101 states have (on average 1.613861386138614) internal successors, (163), 148 states have internal predecessors, (163), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2025-03-04 09:13:46,004 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 36 [2025-03-04 09:13:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:46,005 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2025-03-04 09:13:46,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2025-03-04 09:13:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 09:13:46,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:46,005 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:46,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:13:46,005 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:46,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:46,009 INFO L85 PathProgramCache]: Analyzing trace with hash 965205553, now seen corresponding path program 1 times [2025-03-04 09:13:46,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:46,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833552667] [2025-03-04 09:13:46,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:46,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:46,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 09:13:46,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 09:13:46,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:46,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:46,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:46,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833552667] [2025-03-04 09:13:46,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833552667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:13:46,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009003082] [2025-03-04 09:13:46,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:46,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:46,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:46,255 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:13:46,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:13:46,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 09:13:46,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 09:13:46,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:46,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:46,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:13:46,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:13:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:46,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:13:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:46,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009003082] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:13:46,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:13:46,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-03-04 09:13:46,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023290215] [2025-03-04 09:13:46,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:13:46,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:13:46,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:46,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:13:46,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:13:46,643 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 09:13:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:46,682 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2025-03-04 09:13:46,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:13:46,682 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-03-04 09:13:46,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:46,683 INFO L225 Difference]: With dead ends: 157 [2025-03-04 09:13:46,683 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 09:13:46,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:13:46,684 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 2 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:46,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 551 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:13:46,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 09:13:46,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-04 09:13:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 107 states have (on average 1.5794392523364487) internal successors, (169), 154 states have internal predecessors, (169), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2025-03-04 09:13:46,691 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 36 [2025-03-04 09:13:46,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:46,691 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2025-03-04 09:13:46,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 09:13:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2025-03-04 09:13:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 09:13:46,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:46,692 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:46,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 09:13:46,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:46,893 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:46,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:46,893 INFO L85 PathProgramCache]: Analyzing trace with hash -7963919, now seen corresponding path program 2 times [2025-03-04 09:13:46,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:46,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277423613] [2025-03-04 09:13:46,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:13:46,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:46,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 09:13:46,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-03-04 09:13:46,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:13:46,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:47,258 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-04 09:13:47,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:47,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277423613] [2025-03-04 09:13:47,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277423613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:47,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:47,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:13:47,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220096114] [2025-03-04 09:13:47,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:47,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:13:47,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:47,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:13:47,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:13:47,261 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:47,431 INFO L93 Difference]: Finished difference Result 246 states and 272 transitions. [2025-03-04 09:13:47,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:13:47,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 42 [2025-03-04 09:13:47,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:47,433 INFO L225 Difference]: With dead ends: 246 [2025-03-04 09:13:47,433 INFO L226 Difference]: Without dead ends: 246 [2025-03-04 09:13:47,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:13:47,434 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 333 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:47,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 387 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:13:47,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-04 09:13:47,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 156. [2025-03-04 09:13:47,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 107 states have (on average 1.5700934579439252) internal successors, (168), 153 states have internal predecessors, (168), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2025-03-04 09:13:47,439 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 42 [2025-03-04 09:13:47,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:47,439 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2025-03-04 09:13:47,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:47,440 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2025-03-04 09:13:47,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 09:13:47,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:47,440 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:47,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:13:47,441 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:47,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:47,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1029788538, now seen corresponding path program 1 times [2025-03-04 09:13:47,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:47,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50399094] [2025-03-04 09:13:47,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:47,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:47,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 09:13:47,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 09:13:47,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:47,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:47,828 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-04 09:13:47,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50399094] [2025-03-04 09:13:47,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50399094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:47,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:47,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:13:47,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402721929] [2025-03-04 09:13:47,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:47,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:13:47,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:47,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:13:47,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:13:47,830 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:48,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:48,024 INFO L93 Difference]: Finished difference Result 175 states and 192 transitions. [2025-03-04 09:13:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:13:48,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 45 [2025-03-04 09:13:48,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:48,025 INFO L225 Difference]: With dead ends: 175 [2025-03-04 09:13:48,025 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 09:13:48,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:13:48,026 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 178 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:48,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 185 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:13:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 09:13:48,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2025-03-04 09:13:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 121 states have (on average 1.5702479338842976) internal successors, (190), 167 states have internal predecessors, (190), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 192 transitions. [2025-03-04 09:13:48,033 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 192 transitions. Word has length 45 [2025-03-04 09:13:48,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:48,033 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 192 transitions. [2025-03-04 09:13:48,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:48,034 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 192 transitions. [2025-03-04 09:13:48,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 09:13:48,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:48,036 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:48,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:13:48,036 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:48,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:48,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1029789467, now seen corresponding path program 1 times [2025-03-04 09:13:48,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:48,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444467919] [2025-03-04 09:13:48,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:48,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:48,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 09:13:48,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 09:13:48,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:48,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:48,177 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-04 09:13:48,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:48,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444467919] [2025-03-04 09:13:48,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444467919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:48,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:48,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:13:48,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792721800] [2025-03-04 09:13:48,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:48,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:13:48,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:48,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:13:48,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:13:48,179 INFO L87 Difference]: Start difference. First operand 170 states and 192 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:48,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:48,282 INFO L93 Difference]: Finished difference Result 164 states and 186 transitions. [2025-03-04 09:13:48,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:13:48,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 45 [2025-03-04 09:13:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:48,285 INFO L225 Difference]: With dead ends: 164 [2025-03-04 09:13:48,285 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 09:13:48,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:13:48,285 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 187 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:48,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 120 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:13:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 09:13:48,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-04 09:13:48,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 121 states have (on average 1.5206611570247934) internal successors, (184), 161 states have internal predecessors, (184), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 186 transitions. [2025-03-04 09:13:48,289 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 186 transitions. Word has length 45 [2025-03-04 09:13:48,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:48,289 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 186 transitions. [2025-03-04 09:13:48,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:48,289 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 186 transitions. [2025-03-04 09:13:48,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 09:13:48,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:48,290 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:48,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:13:48,291 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:48,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:48,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1029789466, now seen corresponding path program 1 times [2025-03-04 09:13:48,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:48,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016573805] [2025-03-04 09:13:48,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:48,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:48,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 09:13:48,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 09:13:48,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:48,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:48,508 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-04 09:13:48,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:48,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016573805] [2025-03-04 09:13:48,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016573805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:48,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:48,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:13:48,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686081900] [2025-03-04 09:13:48,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:48,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:13:48,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:48,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:13:48,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:13:48,509 INFO L87 Difference]: Start difference. First operand 164 states and 186 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:48,555 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2025-03-04 09:13:48,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:13:48,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 45 [2025-03-04 09:13:48,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:48,556 INFO L225 Difference]: With dead ends: 169 [2025-03-04 09:13:48,556 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 09:13:48,556 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-04 09:13:48,557 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 160 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:48,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 480 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:13:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 09:13:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2025-03-04 09:13:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 121 states have (on average 1.512396694214876) internal successors, (183), 161 states have internal predecessors, (183), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 185 transitions. [2025-03-04 09:13:48,560 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 185 transitions. Word has length 45 [2025-03-04 09:13:48,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:48,560 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 185 transitions. [2025-03-04 09:13:48,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 185 transitions. [2025-03-04 09:13:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 09:13:48,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:48,561 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] [2025-03-04 09:13:48,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:13:48,561 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:48,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:48,561 INFO L85 PathProgramCache]: Analyzing trace with hash 521175851, now seen corresponding path program 1 times [2025-03-04 09:13:48,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:48,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683129819] [2025-03-04 09:13:48,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:48,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:48,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 09:13:48,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 09:13:48,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:48,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:48,749 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-04 09:13:48,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:48,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683129819] [2025-03-04 09:13:48,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683129819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:48,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:48,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:13:48,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415506086] [2025-03-04 09:13:48,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:48,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:13:48,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:48,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:13:48,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:48,751 INFO L87 Difference]: Start difference. First operand 164 states and 185 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:48,806 INFO L93 Difference]: Finished difference Result 163 states and 183 transitions. [2025-03-04 09:13:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:48,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 48 [2025-03-04 09:13:48,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:48,807 INFO L225 Difference]: With dead ends: 163 [2025-03-04 09:13:48,807 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 09:13:48,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:48,808 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 114 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:48,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 102 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:13:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 09:13:48,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-03-04 09:13:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 121 states have (on average 1.4958677685950412) internal successors, (181), 160 states have internal predecessors, (181), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 183 transitions. [2025-03-04 09:13:48,813 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 183 transitions. Word has length 48 [2025-03-04 09:13:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:48,813 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 183 transitions. [2025-03-04 09:13:48,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 183 transitions. [2025-03-04 09:13:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 09:13:48,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:48,816 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] [2025-03-04 09:13:48,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:13:48,816 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:48,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:48,817 INFO L85 PathProgramCache]: Analyzing trace with hash 521175852, now seen corresponding path program 1 times [2025-03-04 09:13:48,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:48,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281202258] [2025-03-04 09:13:48,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:48,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:48,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 09:13:48,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 09:13:48,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:48,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:49,440 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-04 09:13:49,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:49,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281202258] [2025-03-04 09:13:49,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281202258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:49,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:49,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:13:49,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293616148] [2025-03-04 09:13:49,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:49,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:13:49,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:49,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:13:49,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:13:49,443 INFO L87 Difference]: Start difference. First operand 163 states and 183 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:49,680 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2025-03-04 09:13:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:13:49,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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 48 [2025-03-04 09:13:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:49,681 INFO L225 Difference]: With dead ends: 167 [2025-03-04 09:13:49,681 INFO L226 Difference]: Without dead ends: 167 [2025-03-04 09:13:49,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:13:49,682 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 15 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:49,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 463 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:13:49,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-04 09:13:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2025-03-04 09:13:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 121 states have (on average 1.487603305785124) internal successors, (180), 160 states have internal predecessors, (180), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 182 transitions. [2025-03-04 09:13:49,685 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 182 transitions. Word has length 48 [2025-03-04 09:13:49,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:49,685 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 182 transitions. [2025-03-04 09:13:49,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 182 transitions. [2025-03-04 09:13:49,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 09:13:49,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:49,686 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] [2025-03-04 09:13:49,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:13:49,686 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:49,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:49,687 INFO L85 PathProgramCache]: Analyzing trace with hash 43141022, now seen corresponding path program 1 times [2025-03-04 09:13:49,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:49,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987142178] [2025-03-04 09:13:49,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:49,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:49,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 09:13:49,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 09:13:49,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:49,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:49,984 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-04 09:13:49,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:49,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987142178] [2025-03-04 09:13:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987142178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:49,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:49,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:13:49,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186309844] [2025-03-04 09:13:49,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:49,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:13:49,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:49,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:13:49,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:13:49,987 INFO L87 Difference]: Start difference. First operand 163 states and 182 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:50,131 INFO L93 Difference]: Finished difference Result 162 states and 180 transitions. [2025-03-04 09:13:50,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:13:50,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 51 [2025-03-04 09:13:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:50,132 INFO L225 Difference]: With dead ends: 162 [2025-03-04 09:13:50,132 INFO L226 Difference]: Without dead ends: 162 [2025-03-04 09:13:50,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:13:50,133 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 12 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:50,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 356 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:13:50,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-04 09:13:50,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-04 09:13:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 121 states have (on average 1.4710743801652892) internal successors, (178), 159 states have internal predecessors, (178), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 180 transitions. [2025-03-04 09:13:50,137 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 180 transitions. Word has length 51 [2025-03-04 09:13:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:50,138 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 180 transitions. [2025-03-04 09:13:50,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 180 transitions. [2025-03-04 09:13:50,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 09:13:50,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:50,138 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] [2025-03-04 09:13:50,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:13:50,139 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:50,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:50,139 INFO L85 PathProgramCache]: Analyzing trace with hash 43141023, now seen corresponding path program 1 times [2025-03-04 09:13:50,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:50,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464634353] [2025-03-04 09:13:50,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:50,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:50,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 09:13:50,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 09:13:50,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:50,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:50,526 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-04 09:13:50,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:50,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464634353] [2025-03-04 09:13:50,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464634353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:50,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:50,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:13:50,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680528282] [2025-03-04 09:13:50,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:50,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:13:50,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:50,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:13:50,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:13:50,528 INFO L87 Difference]: Start difference. First operand 162 states and 180 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:50,696 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2025-03-04 09:13:50,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:13:50,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 51 [2025-03-04 09:13:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:50,698 INFO L225 Difference]: With dead ends: 161 [2025-03-04 09:13:50,698 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 09:13:50,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:13:50,698 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 11 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:50,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 336 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:13:50,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 09:13:50,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-03-04 09:13:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 121 states have (on average 1.4545454545454546) internal successors, (176), 158 states have internal predecessors, (176), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 178 transitions. [2025-03-04 09:13:50,702 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 178 transitions. Word has length 51 [2025-03-04 09:13:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:50,702 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 178 transitions. [2025-03-04 09:13:50,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 178 transitions. [2025-03-04 09:13:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 09:13:50,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:50,703 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] [2025-03-04 09:13:50,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:13:50,704 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:50,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:50,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1527226002, now seen corresponding path program 1 times [2025-03-04 09:13:50,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:50,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302822268] [2025-03-04 09:13:50,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:50,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:50,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 09:13:50,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 09:13:50,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:50,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:50,805 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-04 09:13:50,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:50,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302822268] [2025-03-04 09:13:50,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302822268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:50,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:50,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:13:50,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219833002] [2025-03-04 09:13:50,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:50,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:13:50,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:50,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:13:50,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:50,806 INFO L87 Difference]: Start difference. First operand 161 states and 178 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:50,817 INFO L93 Difference]: Finished difference Result 173 states and 193 transitions. [2025-03-04 09:13:50,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:50,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 55 [2025-03-04 09:13:50,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:50,818 INFO L225 Difference]: With dead ends: 173 [2025-03-04 09:13:50,818 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 09:13:50,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:50,819 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 255 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-04 09:13:50,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 255 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:13:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 09:13:50,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2025-03-04 09:13:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.4471544715447155) internal successors, (178), 160 states have internal predecessors, (178), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 180 transitions. [2025-03-04 09:13:50,823 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 180 transitions. Word has length 55 [2025-03-04 09:13:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:50,823 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 180 transitions. [2025-03-04 09:13:50,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 180 transitions. [2025-03-04 09:13:50,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 09:13:50,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:50,824 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] [2025-03-04 09:13:50,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:13:50,824 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:50,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:50,824 INFO L85 PathProgramCache]: Analyzing trace with hash 99612257, now seen corresponding path program 1 times [2025-03-04 09:13:50,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:50,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747350403] [2025-03-04 09:13:50,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:50,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:50,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 09:13:50,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 09:13:50,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:50,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:50,948 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-04 09:13:50,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:50,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747350403] [2025-03-04 09:13:50,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747350403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:50,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:50,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:13:50,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861150595] [2025-03-04 09:13:50,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:50,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:13:50,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:50,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:13:50,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:13:50,950 INFO L87 Difference]: Start difference. First operand 163 states and 180 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:51,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:51,048 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2025-03-04 09:13:51,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:13:51,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 56 [2025-03-04 09:13:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:51,049 INFO L225 Difference]: With dead ends: 162 [2025-03-04 09:13:51,049 INFO L226 Difference]: Without dead ends: 162 [2025-03-04 09:13:51,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:13:51,050 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 5 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:51,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 390 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:13:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-04 09:13:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-04 09:13:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 159 states have internal predecessors, (176), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2025-03-04 09:13:51,056 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 56 [2025-03-04 09:13:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:51,056 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2025-03-04 09:13:51,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2025-03-04 09:13:51,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 09:13:51,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:51,056 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] [2025-03-04 09:13:51,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:13:51,056 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:51,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:51,057 INFO L85 PathProgramCache]: Analyzing trace with hash 99612258, now seen corresponding path program 1 times [2025-03-04 09:13:51,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:51,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872117537] [2025-03-04 09:13:51,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:51,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:51,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 09:13:51,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 09:13:51,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:51,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:51,604 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-04 09:13:51,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:51,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872117537] [2025-03-04 09:13:51,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872117537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:51,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:51,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:13:51,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300412744] [2025-03-04 09:13:51,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:51,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:13:51,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:51,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:13:51,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:13:51,606 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:51,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:51,750 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2025-03-04 09:13:51,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:13:51,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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 56 [2025-03-04 09:13:51,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:51,752 INFO L225 Difference]: With dead ends: 170 [2025-03-04 09:13:51,752 INFO L226 Difference]: Without dead ends: 170 [2025-03-04 09:13:51,752 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-04 09:13:51,752 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 14 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:51,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 333 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:13:51,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-04 09:13:51,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2025-03-04 09:13:51,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.4186046511627908) internal successors, (183), 165 states have internal predecessors, (183), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:51,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2025-03-04 09:13:51,756 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 185 transitions. Word has length 56 [2025-03-04 09:13:51,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:51,756 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 185 transitions. [2025-03-04 09:13:51,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 185 transitions. [2025-03-04 09:13:51,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 09:13:51,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:51,756 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] [2025-03-04 09:13:51,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:13:51,757 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:51,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:51,757 INFO L85 PathProgramCache]: Analyzing trace with hash 110500990, now seen corresponding path program 1 times [2025-03-04 09:13:51,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:51,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037775395] [2025-03-04 09:13:51,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:51,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:51,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 09:13:51,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 09:13:51,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:51,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:51,872 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-04 09:13:51,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:51,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037775395] [2025-03-04 09:13:51,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037775395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:13:51,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413432501] [2025-03-04 09:13:51,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:51,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:51,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:51,875 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:13:51,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:13:52,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 09:13:52,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 09:13:52,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:52,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:52,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 1341 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:13:52,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:13:52,155 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-04 09:13:52,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:13:52,172 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-04 09:13:52,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413432501] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:13:52,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:13:52,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 09:13:52,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18944480] [2025-03-04 09:13:52,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:13:52,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:13:52,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:52,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:13:52,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:13:52,174 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-04 09:13:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:52,204 INFO L93 Difference]: Finished difference Result 195 states and 215 transitions. [2025-03-04 09:13:52,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:13:52,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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 60 [2025-03-04 09:13:52,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:52,206 INFO L225 Difference]: With dead ends: 195 [2025-03-04 09:13:52,206 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 09:13:52,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 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-04 09:13:52,206 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 13 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:52,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 625 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:13:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 09:13:52,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2025-03-04 09:13:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 153 states have (on average 1.392156862745098) internal successors, (213), 189 states have internal predecessors, (213), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 215 transitions. [2025-03-04 09:13:52,210 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 215 transitions. Word has length 60 [2025-03-04 09:13:52,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:52,211 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 215 transitions. [2025-03-04 09:13:52,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-04 09:13:52,211 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 215 transitions. [2025-03-04 09:13:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 09:13:52,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:52,211 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] [2025-03-04 09:13:52,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 09:13:52,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:52,412 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:52,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:52,413 INFO L85 PathProgramCache]: Analyzing trace with hash -869190154, now seen corresponding path program 1 times [2025-03-04 09:13:52,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:52,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766496498] [2025-03-04 09:13:52,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:52,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:52,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 09:13:52,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 09:13:52,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:52,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:52,911 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-04 09:13:52,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:52,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766496498] [2025-03-04 09:13:52,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766496498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:13:52,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849670779] [2025-03-04 09:13:52,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:52,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:52,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:52,916 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:13:52,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:13:53,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 09:13:53,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 09:13:53,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:53,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:53,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 09:13:53,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:13:53,200 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-04 09:13:53,223 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-04 09:13:53,228 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-04 09:13:53,392 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-04 09:13:53,398 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-04 09:13:53,421 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-04 09:13:53,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:13:53,632 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-04 09:13:53,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849670779] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:13:53,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:13:53,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-03-04 09:13:53,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804107832] [2025-03-04 09:13:53,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:13:53,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 09:13:53,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:53,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 09:13:53,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-03-04 09:13:53,636 INFO L87 Difference]: Start difference. First operand 192 states and 215 transitions. Second operand has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:54,089 INFO L93 Difference]: Finished difference Result 191 states and 209 transitions. [2025-03-04 09:13:54,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:13:54,089 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 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 61 [2025-03-04 09:13:54,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:54,090 INFO L225 Difference]: With dead ends: 191 [2025-03-04 09:13:54,090 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 09:13:54,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2025-03-04 09:13:54,091 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 32 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:54,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 824 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 09:13:54,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 09:13:54,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-03-04 09:13:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 153 states have (on average 1.3529411764705883) internal successors, (207), 188 states have internal predecessors, (207), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 209 transitions. [2025-03-04 09:13:54,094 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 209 transitions. Word has length 61 [2025-03-04 09:13:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:54,094 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 209 transitions. [2025-03-04 09:13:54,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 209 transitions. [2025-03-04 09:13:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 09:13:54,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:54,095 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] [2025-03-04 09:13:54,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:13:54,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:54,299 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:54,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:54,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1995498898, now seen corresponding path program 2 times [2025-03-04 09:13:54,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:54,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656035946] [2025-03-04 09:13:54,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:13:54,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:54,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-04 09:13:54,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 09:13:54,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:13:54,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:54,490 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-04 09:13:54,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:54,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656035946] [2025-03-04 09:13:54,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656035946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:13:54,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750564478] [2025-03-04 09:13:54,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:13:54,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:54,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:54,493 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:13:54,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:13:54,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-04 09:13:54,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 09:13:54,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:13:54,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:54,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 09:13:54,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:13:54,842 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-04 09:13:54,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:13:54,936 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-04 09:13:54,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750564478] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:13:54,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:13:54,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 09:13:54,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613135053] [2025-03-04 09:13:54,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:13:54,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:13:54,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:54,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:13:54,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:13:54,939 INFO L87 Difference]: Start difference. First operand 191 states and 209 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:54,977 INFO L93 Difference]: Finished difference Result 260 states and 275 transitions. [2025-03-04 09:13:54,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:13:54,978 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 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 75 [2025-03-04 09:13:54,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:54,979 INFO L225 Difference]: With dead ends: 260 [2025-03-04 09:13:54,979 INFO L226 Difference]: Without dead ends: 260 [2025-03-04 09:13:54,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 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-04 09:13:54,979 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 29 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:54,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 521 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:13:54,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-04 09:13:54,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 251. [2025-03-04 09:13:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 213 states have (on average 1.2816901408450705) internal successors, (273), 248 states have internal predecessors, (273), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 275 transitions. [2025-03-04 09:13:54,985 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 275 transitions. Word has length 75 [2025-03-04 09:13:54,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:54,985 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 275 transitions. [2025-03-04 09:13:54,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:54,985 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 275 transitions. [2025-03-04 09:13:54,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 09:13:54,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:54,986 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] [2025-03-04 09:13:54,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 09:13:55,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:55,190 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:55,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:55,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1815412754, now seen corresponding path program 3 times [2025-03-04 09:13:55,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:55,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845641753] [2025-03-04 09:13:55,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:13:55,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:55,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 12 equivalence classes. [2025-03-04 09:13:55,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 105 statements. [2025-03-04 09:13:55,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 09:13:55,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:55,687 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-04 09:13:55,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845641753] [2025-03-04 09:13:55,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845641753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:13:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498519634] [2025-03-04 09:13:55,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:13:55,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:55,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:55,694 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-04 09:13:55,701 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-04 09:13:55,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 12 equivalence classes. [2025-03-04 09:13:56,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 105 statements. [2025-03-04 09:13:56,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 09:13:56,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:56,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 09:13:56,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:13:56,111 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 09:13:56,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 09:13:56,136 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:13:56,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:13:56,181 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-04 09:13:56,254 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 8 treesize of output 4 [2025-03-04 09:13:56,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:13:56,655 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-04 09:13:56,662 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:13:56,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:13:56,681 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-04 09:13:56,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:13:57,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:13:57,718 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-04 09:13:57,859 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-04 09:13:57,876 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-04 09:13:57,877 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-04 09:13:57,904 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-04 09:13:57,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498519634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:13:57,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:13:57,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 23 [2025-03-04 09:13:57,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820596124] [2025-03-04 09:13:57,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:13:57,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 09:13:57,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:57,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 09:13:57,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2025-03-04 09:13:57,906 INFO L87 Difference]: Start difference. First operand 251 states and 275 transitions. Second operand has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 09:13:58,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:58,544 INFO L93 Difference]: Finished difference Result 367 states and 388 transitions. [2025-03-04 09:13:58,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:13:58,544 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-03-04 09:13:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:58,546 INFO L225 Difference]: With dead ends: 367 [2025-03-04 09:13:58,546 INFO L226 Difference]: Without dead ends: 367 [2025-03-04 09:13:58,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=786, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 09:13:58,547 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 435 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:58,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 597 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 09:13:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-04 09:13:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 192. [2025-03-04 09:13:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 158 states have (on average 1.2911392405063291) internal successors, (204), 189 states have internal predecessors, (204), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions. [2025-03-04 09:13:58,556 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 105 [2025-03-04 09:13:58,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:58,557 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions. [2025-03-04 09:13:58,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 09:13:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions. [2025-03-04 09:13:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 09:13:58,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:58,558 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] [2025-03-04 09:13:58,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 09:13:58,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:58,758 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:13:58,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:58,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1815411826, now seen corresponding path program 1 times [2025-03-04 09:13:58,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:58,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665367695] [2025-03-04 09:13:58,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:58,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:58,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 09:13:58,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 09:13:58,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:58,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:59,290 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-04 09:13:59,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:59,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665367695] [2025-03-04 09:13:59,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665367695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:13:59,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863984214] [2025-03-04 09:13:59,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:59,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:59,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:59,293 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-04 09:13:59,295 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-04 09:13:59,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 09:13:59,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 09:13:59,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:59,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:59,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1610 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 09:13:59,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:13:59,694 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:13:59,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:13:59,699 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-04 09:13:59,718 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 23 treesize of output 1 [2025-03-04 09:14:00,045 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 12 treesize of output 4 [2025-03-04 09:14:00,076 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-04 09:14:00,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:00,325 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-04 09:14:00,340 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-04 09:14:00,341 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-04 09:14:00,368 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-04 09:14:00,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863984214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:00,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:00,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 6] total 19 [2025-03-04 09:14:00,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704377319] [2025-03-04 09:14:00,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:00,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 09:14:00,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:00,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 09:14:00,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-03-04 09:14:00,370 INFO L87 Difference]: Start difference. First operand 192 states and 206 transitions. Second operand has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:00,715 INFO L93 Difference]: Finished difference Result 252 states and 270 transitions. [2025-03-04 09:14:00,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:14:00,716 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 states have internal predecessors, (75), 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 105 [2025-03-04 09:14:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:00,717 INFO L225 Difference]: With dead ends: 252 [2025-03-04 09:14:00,717 INFO L226 Difference]: Without dead ends: 252 [2025-03-04 09:14:00,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2025-03-04 09:14:00,718 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 1053 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:00,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 339 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:14:00,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-04 09:14:00,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 191. [2025-03-04 09:14:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 161 states have (on average 1.2608695652173914) internal successors, (203), 188 states have internal predecessors, (203), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 205 transitions. [2025-03-04 09:14:00,722 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 205 transitions. Word has length 105 [2025-03-04 09:14:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:00,722 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 205 transitions. [2025-03-04 09:14:00,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 205 transitions. [2025-03-04 09:14:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 09:14:00,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:00,723 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] [2025-03-04 09:14:00,732 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-04 09:14:00,927 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,SelfDestructingSolverStorable22 [2025-03-04 09:14:00,927 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:00,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:00,927 INFO L85 PathProgramCache]: Analyzing trace with hash 733279264, now seen corresponding path program 1 times [2025-03-04 09:14:00,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:00,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260531312] [2025-03-04 09:14:00,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:00,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:00,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 09:14:00,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 09:14:00,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:00,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:01,894 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-04 09:14:01,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:01,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260531312] [2025-03-04 09:14:01,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260531312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:01,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290481181] [2025-03-04 09:14:01,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:01,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:01,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:01,898 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-04 09:14:01,900 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-04 09:14:02,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 09:14:02,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 09:14:02,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:02,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:02,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 1627 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 09:14:02,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:02,255 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-04 09:14:02,260 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-04 09:14:02,274 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-04 09:14:02,275 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-04 09:14:02,388 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:14:02,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:14:02,403 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-03-04 09:14:02,404 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 41 treesize of output 41 [2025-03-04 09:14:02,452 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-04 09:14:03,774 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 28 treesize of output 20 [2025-03-04 09:14:03,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:03,896 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-04 09:14:03,904 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:14:03,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:14:03,981 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-04 09:14:03,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:04,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:14:04,715 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-04 09:14:04,911 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-04 09:14:04,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290481181] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:04,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:04,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 24 [2025-03-04 09:14:04,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553519] [2025-03-04 09:14:04,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:04,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 09:14:04,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:04,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 09:14:04,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-03-04 09:14:04,914 INFO L87 Difference]: Start difference. First operand 191 states and 205 transitions. Second operand has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:05,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:05,687 INFO L93 Difference]: Finished difference Result 371 states and 391 transitions. [2025-03-04 09:14:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:14:05,688 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 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 108 [2025-03-04 09:14:05,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:05,689 INFO L225 Difference]: With dead ends: 371 [2025-03-04 09:14:05,689 INFO L226 Difference]: Without dead ends: 371 [2025-03-04 09:14:05,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2025-03-04 09:14:05,690 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 414 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:05,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 582 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:14:05,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-04 09:14:05,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-03-04 09:14:05,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 341 states have (on average 1.1407624633431086) internal successors, (389), 368 states have internal predecessors, (389), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:05,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 391 transitions. [2025-03-04 09:14:05,695 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 391 transitions. Word has length 108 [2025-03-04 09:14:05,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:05,695 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 391 transitions. [2025-03-04 09:14:05,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:05,695 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 391 transitions. [2025-03-04 09:14:05,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 09:14:05,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:05,696 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-04 09:14:05,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 09:14:05,897 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,SelfDestructingSolverStorable23 [2025-03-04 09:14:05,897 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:05,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:05,897 INFO L85 PathProgramCache]: Analyzing trace with hash -521169184, now seen corresponding path program 1 times [2025-03-04 09:14:05,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:05,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170847551] [2025-03-04 09:14:05,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:05,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:05,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 09:14:05,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 09:14:05,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:05,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:06,087 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-04 09:14:06,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:06,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170847551] [2025-03-04 09:14:06,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170847551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:06,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:06,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:14:06,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974116153] [2025-03-04 09:14:06,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:06,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:14:06,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:06,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:14:06,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:14:06,089 INFO L87 Difference]: Start difference. First operand 371 states and 391 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-04 09:14:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:06,130 INFO L93 Difference]: Finished difference Result 377 states and 398 transitions. [2025-03-04 09:14:06,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:14:06,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-04 09:14:06,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:06,132 INFO L225 Difference]: With dead ends: 377 [2025-03-04 09:14:06,132 INFO L226 Difference]: Without dead ends: 377 [2025-03-04 09:14:06,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:14:06,133 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 5 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:06,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 442 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:14:06,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-04 09:14:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 374. [2025-03-04 09:14:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 344 states have (on average 1.1395348837209303) internal successors, (392), 371 states have internal predecessors, (392), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 394 transitions. [2025-03-04 09:14:06,142 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 394 transitions. Word has length 110 [2025-03-04 09:14:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:06,142 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 394 transitions. [2025-03-04 09:14:06,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-04 09:14:06,143 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 394 transitions. [2025-03-04 09:14:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 09:14:06,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:06,144 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-04 09:14:06,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 09:14:06,144 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:06,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:06,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1414370313, now seen corresponding path program 1 times [2025-03-04 09:14:06,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:06,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745313664] [2025-03-04 09:14:06,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:06,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:06,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 09:14:06,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 09:14:06,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:06,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:07,628 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-04 09:14:07,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:07,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745313664] [2025-03-04 09:14:07,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745313664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:07,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550425070] [2025-03-04 09:14:07,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:07,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:07,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:07,632 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-04 09:14:07,633 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-04 09:14:07,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 09:14:07,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 09:14:07,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:07,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:07,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 09:14:07,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:07,997 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-04 09:14:07,999 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-04 09:14:08,050 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2025-03-04 09:14:08,050 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-04 09:14:08,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:08,056 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-04 09:14:08,474 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-04 09:14:08,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:08,864 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-04 09:14:08,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550425070] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:08,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:08,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2025-03-04 09:14:08,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803129304] [2025-03-04 09:14:08,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:08,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 09:14:08,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:08,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 09:14:08,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-04 09:14:08,866 INFO L87 Difference]: Start difference. First operand 374 states and 394 transitions. Second operand has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:09,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:09,136 INFO L93 Difference]: Finished difference Result 396 states and 417 transitions. [2025-03-04 09:14:09,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:14:09,137 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 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-04 09:14:09,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:09,148 INFO L225 Difference]: With dead ends: 396 [2025-03-04 09:14:09,149 INFO L226 Difference]: Without dead ends: 396 [2025-03-04 09:14:09,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 214 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-04 09:14:09,149 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 259 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:09,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1015 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:14:09,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-04 09:14:09,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 376. [2025-03-04 09:14:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 346 states have (on average 1.138728323699422) internal successors, (394), 373 states have internal predecessors, (394), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 396 transitions. [2025-03-04 09:14:09,158 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 396 transitions. Word has length 112 [2025-03-04 09:14:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:09,158 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 396 transitions. [2025-03-04 09:14:09,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 396 transitions. [2025-03-04 09:14:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 09:14:09,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:09,159 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-04 09:14:09,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 09:14:09,360 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,SelfDestructingSolverStorable25 [2025-03-04 09:14:09,360 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:09,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:09,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1007751529, now seen corresponding path program 1 times [2025-03-04 09:14:09,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:09,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812826402] [2025-03-04 09:14:09,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:09,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:09,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 09:14:09,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 09:14:09,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:09,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:09,517 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-04 09:14:09,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:09,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812826402] [2025-03-04 09:14:09,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812826402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:09,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:09,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:14:09,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219537218] [2025-03-04 09:14:09,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:09,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:14:09,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:09,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:14:09,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:14:09,521 INFO L87 Difference]: Start difference. First operand 376 states and 396 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:09,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:09,532 INFO L93 Difference]: Finished difference Result 380 states and 401 transitions. [2025-03-04 09:14:09,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:14:09,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-04 09:14:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:09,533 INFO L225 Difference]: With dead ends: 380 [2025-03-04 09:14:09,533 INFO L226 Difference]: Without dead ends: 380 [2025-03-04 09:14:09,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:14:09,534 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 235 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-04 09:14:09,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 235 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:14:09,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-04 09:14:09,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2025-03-04 09:14:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 347 states have (on average 1.138328530259366) internal successors, (395), 374 states have internal predecessors, (395), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 397 transitions. [2025-03-04 09:14:09,541 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 397 transitions. Word has length 115 [2025-03-04 09:14:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:09,541 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 397 transitions. [2025-03-04 09:14:09,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 397 transitions. [2025-03-04 09:14:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 09:14:09,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:09,542 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-04 09:14:09,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 09:14:09,542 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:09,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:09,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1007751370, now seen corresponding path program 1 times [2025-03-04 09:14:09,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:09,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667899096] [2025-03-04 09:14:09,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:09,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:09,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 09:14:09,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 09:14:09,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:09,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:09,756 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-04 09:14:09,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:09,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667899096] [2025-03-04 09:14:09,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667899096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:09,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:09,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:14:09,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599741929] [2025-03-04 09:14:09,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:09,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:14:09,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:09,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:14:09,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:14:09,758 INFO L87 Difference]: Start difference. First operand 377 states and 397 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:09,768 INFO L93 Difference]: Finished difference Result 378 states and 398 transitions. [2025-03-04 09:14:09,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:14:09,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-04 09:14:09,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:09,770 INFO L225 Difference]: With dead ends: 378 [2025-03-04 09:14:09,770 INFO L226 Difference]: Without dead ends: 378 [2025-03-04 09:14:09,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:14:09,771 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:09,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:14:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-04 09:14:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-03-04 09:14:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 348 states have (on average 1.1379310344827587) internal successors, (396), 375 states have internal predecessors, (396), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 398 transitions. [2025-03-04 09:14:09,779 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 398 transitions. Word has length 115 [2025-03-04 09:14:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:09,780 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 398 transitions. [2025-03-04 09:14:09,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 398 transitions. [2025-03-04 09:14:09,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 09:14:09,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:09,781 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-04 09:14:09,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 09:14:09,782 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:09,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:09,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1976123657, now seen corresponding path program 1 times [2025-03-04 09:14:09,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:09,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879866759] [2025-03-04 09:14:09,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:09,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:09,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 09:14:09,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 09:14:09,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:09,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2025-03-04 09:14:10,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:10,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879866759] [2025-03-04 09:14:10,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879866759] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:10,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207895701] [2025-03-04 09:14:10,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:10,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:10,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:10,531 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-04 09:14:10,533 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-04 09:14:10,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 09:14:10,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 09:14:10,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:10,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:10,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 09:14:10,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:10,931 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 09:14:10,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 09:14:11,008 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2025-03-04 09:14:11,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 09:14:11,026 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 09:14:11,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 09:14:11,053 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 09:14:11,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 09:14:11,077 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-04 09:14:11,482 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 44 treesize of output 28 [2025-03-04 09:14:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 94 proven. 14 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-03-04 09:14:11,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 93 proven. 15 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-03-04 09:14:12,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207895701] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:12,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:12,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 10] total 25 [2025-03-04 09:14:12,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147137917] [2025-03-04 09:14:12,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:12,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 09:14:12,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:12,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 09:14:12,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2025-03-04 09:14:12,164 INFO L87 Difference]: Start difference. First operand 378 states and 398 transitions. Second operand has 26 states, 25 states have (on average 5.28) internal successors, (132), 26 states have internal predecessors, (132), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 09:14:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:12,232 INFO L93 Difference]: Finished difference Result 376 states and 396 transitions. [2025-03-04 09:14:12,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:14:12,232 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.28) internal successors, (132), 26 states have internal predecessors, (132), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 116 [2025-03-04 09:14:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:12,234 INFO L225 Difference]: With dead ends: 376 [2025-03-04 09:14:12,234 INFO L226 Difference]: Without dead ends: 376 [2025-03-04 09:14:12,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 216 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2025-03-04 09:14:12,236 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 564 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:12,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 78 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:14:12,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-04 09:14:12,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-03-04 09:14:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 348 states have (on average 1.132183908045977) internal successors, (394), 373 states have internal predecessors, (394), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 396 transitions. [2025-03-04 09:14:12,242 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 396 transitions. Word has length 116 [2025-03-04 09:14:12,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:12,242 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 396 transitions. [2025-03-04 09:14:12,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.28) internal successors, (132), 26 states have internal predecessors, (132), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 09:14:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 396 transitions. [2025-03-04 09:14:12,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 09:14:12,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:12,244 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-04 09:14:12,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 09:14:12,444 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,SelfDestructingSolverStorable28 [2025-03-04 09:14:12,445 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:12,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:12,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1976123656, now seen corresponding path program 1 times [2025-03-04 09:14:12,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:12,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138936503] [2025-03-04 09:14:12,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:12,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:12,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 09:14:12,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 09:14:12,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:12,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:13,667 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-04 09:14:13,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:13,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138936503] [2025-03-04 09:14:13,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138936503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:13,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826319613] [2025-03-04 09:14:13,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:13,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:13,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:13,671 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-04 09:14:13,672 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-04 09:14:13,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 09:14:14,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 09:14:14,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:14,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:14,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 09:14:14,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:14,142 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 09:14:14,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 09:14:14,146 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-04 09:14:14,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:14,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:14,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-03-04 09:14:14,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:14,319 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 09:14:14,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-04 09:14:14,360 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 09:14:14,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 09:14:14,411 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 23 treesize of output 1 [2025-03-04 09:14:14,570 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 31 treesize of output 15 [2025-03-04 09:14:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-03-04 09:14:14,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:15,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826319613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:15,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:14:15,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 19 [2025-03-04 09:14:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933019740] [2025-03-04 09:14:15,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:15,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 09:14:15,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:15,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 09:14:15,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2025-03-04 09:14:15,042 INFO L87 Difference]: Start difference. First operand 376 states and 396 transitions. Second operand has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 20 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:14:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:15,531 INFO L93 Difference]: Finished difference Result 377 states and 397 transitions. [2025-03-04 09:14:15,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:14:15,531 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 20 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 116 [2025-03-04 09:14:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:15,532 INFO L225 Difference]: With dead ends: 377 [2025-03-04 09:14:15,533 INFO L226 Difference]: Without dead ends: 377 [2025-03-04 09:14:15,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=291, Invalid=765, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 09:14:15,533 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 1010 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:15,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 349 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 09:14:15,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-04 09:14:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 376. [2025-03-04 09:14:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 349 states have (on average 1.1289398280802292) internal successors, (394), 373 states have internal predecessors, (394), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 396 transitions. [2025-03-04 09:14:15,543 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 396 transitions. Word has length 116 [2025-03-04 09:14:15,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:15,543 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 396 transitions. [2025-03-04 09:14:15,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 20 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:14:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 396 transitions. [2025-03-04 09:14:15,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 09:14:15,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:15,547 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, 1, 1] [2025-03-04 09:14:15,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 09:14:15,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:15,748 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:15,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:15,748 INFO L85 PathProgramCache]: Analyzing trace with hash 416880571, now seen corresponding path program 1 times [2025-03-04 09:14:15,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:15,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117102216] [2025-03-04 09:14:15,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:15,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:15,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 09:14:15,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 09:14:15,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:15,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-04 09:14:16,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:16,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117102216] [2025-03-04 09:14:16,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117102216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:16,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993852965] [2025-03-04 09:14:16,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:16,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:16,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:16,740 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-04 09:14:16,742 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-04 09:14:16,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 09:14:17,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 09:14:17,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:17,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:17,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 1689 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 09:14:17,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:17,179 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 09:14:17,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 09:14:17,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 09:14:17,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:17,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:17,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-03-04 09:14:17,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:17,441 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 09:14:17,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-04 09:14:17,508 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 09:14:17,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 09:14:17,555 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-04 09:14:18,236 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 23 treesize of output 15 [2025-03-04 09:14:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-04 09:14:18,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:19,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993852965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:19,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:14:19,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 24 [2025-03-04 09:14:19,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352363016] [2025-03-04 09:14:19,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:19,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 09:14:19,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:19,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 09:14:19,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=893, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 09:14:19,007 INFO L87 Difference]: Start difference. First operand 376 states and 396 transitions. Second operand has 25 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:14:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:19,472 INFO L93 Difference]: Finished difference Result 383 states and 403 transitions. [2025-03-04 09:14:19,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:14:19,472 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 119 [2025-03-04 09:14:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:19,473 INFO L225 Difference]: With dead ends: 383 [2025-03-04 09:14:19,473 INFO L226 Difference]: Without dead ends: 383 [2025-03-04 09:14:19,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=524, Invalid=1546, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 09:14:19,474 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 606 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:19,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 390 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:14:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-04 09:14:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 382. [2025-03-04 09:14:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 355 states have (on average 1.1267605633802817) internal successors, (400), 379 states have internal predecessors, (400), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 402 transitions. [2025-03-04 09:14:19,479 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 402 transitions. Word has length 119 [2025-03-04 09:14:19,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:19,479 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 402 transitions. [2025-03-04 09:14:19,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:14:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 402 transitions. [2025-03-04 09:14:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 09:14:19,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:19,481 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:19,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 09:14:19,681 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,SelfDestructingSolverStorable30 [2025-03-04 09:14:19,681 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:19,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:19,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1808802149, now seen corresponding path program 2 times [2025-03-04 09:14:19,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:19,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43112885] [2025-03-04 09:14:19,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:14:19,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:19,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-03-04 09:14:19,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 09:14:19,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:14:19,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-04 09:14:20,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:20,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43112885] [2025-03-04 09:14:20,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43112885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:20,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806287953] [2025-03-04 09:14:20,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:14:20,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:20,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:20,606 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-04 09:14:20,607 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-04 09:14:20,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-03-04 09:14:20,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 09:14:20,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:14:20,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:21,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 1731 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 09:14:21,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:21,036 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 09:14:21,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 09:14:21,041 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-04 09:14:21,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:21,220 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 09:14:21,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-04 09:14:21,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-03-04 09:14:21,233 INFO L349 Elim1Store]: treesize reduction 19, result has 13.6 percent of original size [2025-03-04 09:14:21,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 7 [2025-03-04 09:14:21,268 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 09:14:21,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 09:14:21,291 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 23 treesize of output 1 [2025-03-04 09:14:21,703 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 31 treesize of output 15 [2025-03-04 09:14:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-04 09:14:21,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:22,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806287953] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:22,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:14:22,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 23 [2025-03-04 09:14:22,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929306313] [2025-03-04 09:14:22,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:22,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 09:14:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:22,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 09:14:22,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2025-03-04 09:14:22,326 INFO L87 Difference]: Start difference. First operand 382 states and 402 transitions. Second operand has 24 states, 22 states have (on average 4.909090909090909) internal successors, (108), 22 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:14:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:22,884 INFO L93 Difference]: Finished difference Result 386 states and 406 transitions. [2025-03-04 09:14:22,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:14:22,884 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 4.909090909090909) internal successors, (108), 22 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 125 [2025-03-04 09:14:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:22,886 INFO L225 Difference]: With dead ends: 386 [2025-03-04 09:14:22,886 INFO L226 Difference]: Without dead ends: 386 [2025-03-04 09:14:22,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=357, Invalid=1365, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 09:14:22,887 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 473 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:22,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 675 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 09:14:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-04 09:14:22,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2025-03-04 09:14:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 358 states have (on average 1.1256983240223464) internal successors, (403), 382 states have internal predecessors, (403), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 405 transitions. [2025-03-04 09:14:22,895 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 405 transitions. Word has length 125 [2025-03-04 09:14:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:22,896 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 405 transitions. [2025-03-04 09:14:22,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 4.909090909090909) internal successors, (108), 22 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:14:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 405 transitions. [2025-03-04 09:14:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 09:14:22,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:22,897 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:22,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 09:14:23,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:23,099 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:23,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:23,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1365135048, now seen corresponding path program 3 times [2025-03-04 09:14:23,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:23,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932833478] [2025-03-04 09:14:23,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:14:23,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:23,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 12 equivalence classes. [2025-03-04 09:14:23,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 128 statements. [2025-03-04 09:14:23,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 09:14:23,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:23,822 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2025-03-04 09:14:23,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:23,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932833478] [2025-03-04 09:14:23,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932833478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:23,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441910701] [2025-03-04 09:14:23,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:14:23,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:23,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:23,826 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-04 09:14:23,827 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-04 09:14:24,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 12 equivalence classes. [2025-03-04 09:14:24,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 128 statements. [2025-03-04 09:14:24,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 09:14:24,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:24,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 09:14:24,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:24,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:24,271 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-04 09:14:24,285 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 09:14:24,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 09:14:24,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:24,508 INFO L349 Elim1Store]: treesize reduction 40, result has 25.9 percent of original size [2025-03-04 09:14:24,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 28 [2025-03-04 09:14:24,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-03-04 09:14:24,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:24,557 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-04 09:14:24,875 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2025-03-04 09:14:24,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:25,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441910701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:25,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:14:25,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 19 [2025-03-04 09:14:25,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376441925] [2025-03-04 09:14:25,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:25,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 09:14:25,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:25,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 09:14:25,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2025-03-04 09:14:25,228 INFO L87 Difference]: Start difference. First operand 385 states and 405 transitions. Second operand has 20 states, 18 states have (on average 5.222222222222222) internal successors, (94), 18 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:14:25,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:25,642 INFO L93 Difference]: Finished difference Result 384 states and 404 transitions. [2025-03-04 09:14:25,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:14:25,643 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 5.222222222222222) internal successors, (94), 18 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 128 [2025-03-04 09:14:25,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:25,644 INFO L225 Difference]: With dead ends: 384 [2025-03-04 09:14:25,644 INFO L226 Difference]: Without dead ends: 384 [2025-03-04 09:14:25,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=282, Invalid=908, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 09:14:25,645 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 516 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:25,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 374 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:14:25,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-04 09:14:25,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 383. [2025-03-04 09:14:25,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 357 states have (on average 1.123249299719888) internal successors, (401), 380 states have internal predecessors, (401), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:25,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 403 transitions. [2025-03-04 09:14:25,652 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 403 transitions. Word has length 128 [2025-03-04 09:14:25,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:25,653 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 403 transitions. [2025-03-04 09:14:25,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 5.222222222222222) internal successors, (94), 18 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:14:25,653 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 403 transitions. [2025-03-04 09:14:25,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 09:14:25,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:25,655 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:25,668 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-04 09:14:25,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:25,856 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:25,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:25,858 INFO L85 PathProgramCache]: Analyzing trace with hash 302329334, now seen corresponding path program 1 times [2025-03-04 09:14:25,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:25,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411302576] [2025-03-04 09:14:25,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:25,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:25,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 09:14:25,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 09:14:25,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:25,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:26,131 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-04 09:14:26,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:26,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411302576] [2025-03-04 09:14:26,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411302576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:26,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320553503] [2025-03-04 09:14:26,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:26,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:26,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:26,134 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-04 09:14:26,135 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-04 09:14:26,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 09:14:26,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 09:14:26,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:26,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:26,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 1774 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 09:14:26,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-04 09:14:26,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-04 09:14:26,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320553503] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:26,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:26,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 09:14:26,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024531948] [2025-03-04 09:14:26,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:26,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:14:26,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:26,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:14:26,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:14:26,682 INFO L87 Difference]: Start difference. First operand 383 states and 403 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:26,716 INFO L93 Difference]: Finished difference Result 401 states and 421 transitions. [2025-03-04 09:14:26,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:14:26,716 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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 131 [2025-03-04 09:14:26,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:26,717 INFO L225 Difference]: With dead ends: 401 [2025-03-04 09:14:26,717 INFO L226 Difference]: Without dead ends: 401 [2025-03-04 09:14:26,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 256 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-04 09:14:26,718 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:26,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 229 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:14:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-04 09:14:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-03-04 09:14:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 375 states have (on average 1.1173333333333333) internal successors, (419), 398 states have internal predecessors, (419), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 421 transitions. [2025-03-04 09:14:26,722 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 421 transitions. Word has length 131 [2025-03-04 09:14:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:26,722 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 421 transitions. [2025-03-04 09:14:26,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 421 transitions. [2025-03-04 09:14:26,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 09:14:26,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:26,724 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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-04 09:14:26,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 09:14:26,924 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,SelfDestructingSolverStorable33 [2025-03-04 09:14:26,925 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:26,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:26,925 INFO L85 PathProgramCache]: Analyzing trace with hash -206071146, now seen corresponding path program 2 times [2025-03-04 09:14:26,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:26,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567159548] [2025-03-04 09:14:26,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:14:26,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:26,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 149 statements into 2 equivalence classes. [2025-03-04 09:14:27,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 09:14:27,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:14:27,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-04 09:14:27,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:27,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567159548] [2025-03-04 09:14:27,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567159548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:27,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278800916] [2025-03-04 09:14:27,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:14:27,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:27,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:27,341 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-04 09:14:27,343 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-04 09:14:27,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 149 statements into 2 equivalence classes. [2025-03-04 09:14:27,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 09:14:27,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:14:27,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:27,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 1900 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 09:14:27,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-04 09:14:27,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-04 09:14:28,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278800916] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:28,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:28,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-04 09:14:28,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906892575] [2025-03-04 09:14:28,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:28,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 09:14:28,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:28,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 09:14:28,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-04 09:14:28,002 INFO L87 Difference]: Start difference. First operand 401 states and 421 transitions. Second operand has 25 states, 25 states have (on average 4.44) internal successors, (111), 25 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:28,059 INFO L93 Difference]: Finished difference Result 437 states and 457 transitions. [2025-03-04 09:14:28,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 09:14:28,060 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.44) internal successors, (111), 25 states have internal predecessors, (111), 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 149 [2025-03-04 09:14:28,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:28,061 INFO L225 Difference]: With dead ends: 437 [2025-03-04 09:14:28,061 INFO L226 Difference]: Without dead ends: 437 [2025-03-04 09:14:28,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-04 09:14:28,062 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:28,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 568 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:14:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-04 09:14:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2025-03-04 09:14:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 411 states have (on average 1.1070559610705597) internal successors, (455), 434 states have internal predecessors, (455), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 457 transitions. [2025-03-04 09:14:28,067 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 457 transitions. Word has length 149 [2025-03-04 09:14:28,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:28,067 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 457 transitions. [2025-03-04 09:14:28,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.44) internal successors, (111), 25 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:28,068 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 457 transitions. [2025-03-04 09:14:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 09:14:28,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:28,069 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:28,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 09:14:28,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:28,269 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:28,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:28,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2002074859, now seen corresponding path program 2 times [2025-03-04 09:14:28,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:28,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764546668] [2025-03-04 09:14:28,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:14:28,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:28,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 172 statements into 2 equivalence classes. [2025-03-04 09:14:28,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 09:14:28,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:14:28,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 19 proven. 550 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 09:14:29,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:29,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764546668] [2025-03-04 09:14:29,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764546668] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:29,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498376020] [2025-03-04 09:14:29,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:14:29,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:29,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:29,075 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-04 09:14:29,076 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-04 09:14:29,401 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 172 statements into 2 equivalence classes. [2025-03-04 09:14:29,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 09:14:29,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:14:29,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:29,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 2007 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 09:14:29,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:29,671 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-04 09:14:29,684 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-04 09:14:29,807 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-04 09:14:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-04 09:14:29,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:29,903 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 18 treesize of output 16 [2025-03-04 09:14:29,905 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 24 treesize of output 20 [2025-03-04 09:14:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-04 09:14:29,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498376020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:29,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:29,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2025-03-04 09:14:29,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506230700] [2025-03-04 09:14:29,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:29,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 09:14:29,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:29,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 09:14:29,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-04 09:14:29,994 INFO L87 Difference]: Start difference. First operand 437 states and 457 transitions. Second operand has 16 states, 15 states have (on average 7.533333333333333) internal successors, (113), 16 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:30,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:30,284 INFO L93 Difference]: Finished difference Result 589 states and 623 transitions. [2025-03-04 09:14:30,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:14:30,285 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.533333333333333) internal successors, (113), 16 states have internal predecessors, (113), 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 172 [2025-03-04 09:14:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:30,286 INFO L225 Difference]: With dead ends: 589 [2025-03-04 09:14:30,286 INFO L226 Difference]: Without dead ends: 589 [2025-03-04 09:14:30,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-03-04 09:14:30,287 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 335 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:30,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 935 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:14:30,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-04 09:14:30,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 445. [2025-03-04 09:14:30,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 419 states have (on average 1.1097852028639619) internal successors, (465), 442 states have internal predecessors, (465), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 467 transitions. [2025-03-04 09:14:30,292 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 467 transitions. Word has length 172 [2025-03-04 09:14:30,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:30,292 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 467 transitions. [2025-03-04 09:14:30,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.533333333333333) internal successors, (113), 16 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 467 transitions. [2025-03-04 09:14:30,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 09:14:30,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:30,293 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:30,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 09:14:30,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:30,494 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:30,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:30,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1934737900, now seen corresponding path program 1 times [2025-03-04 09:14:30,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:30,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574271840] [2025-03-04 09:14:30,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:30,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:30,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 09:14:30,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 09:14:30,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:30,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2025-03-04 09:14:30,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:30,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574271840] [2025-03-04 09:14:30,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574271840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:30,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:30,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:14:30,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494662701] [2025-03-04 09:14:30,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:30,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:14:30,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:30,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:14:30,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:14:30,723 INFO L87 Difference]: Start difference. First operand 445 states and 467 transitions. Second operand has 3 states, 3 states have (on average 13.0) 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-04 09:14:30,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:30,728 INFO L93 Difference]: Finished difference Result 408 states and 422 transitions. [2025-03-04 09:14:30,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:14:30,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) 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 173 [2025-03-04 09:14:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:30,729 INFO L225 Difference]: With dead ends: 408 [2025-03-04 09:14:30,729 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 09:14:30,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:14:30,730 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:30,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:14:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 09:14:30,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-03-04 09:14:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 398 states have (on average 1.0552763819095476) internal successors, (420), 405 states have internal predecessors, (420), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 422 transitions. [2025-03-04 09:14:30,735 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 422 transitions. Word has length 173 [2025-03-04 09:14:30,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:30,735 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 422 transitions. [2025-03-04 09:14:30,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) 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-04 09:14:30,735 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 422 transitions. [2025-03-04 09:14:30,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 09:14:30,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:30,736 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:30,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 09:14:30,736 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:30,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:30,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1934778583, now seen corresponding path program 1 times [2025-03-04 09:14:30,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:30,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35675727] [2025-03-04 09:14:30,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:30,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:30,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 09:14:30,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 09:14:30,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:30,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-04 09:14:31,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:31,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35675727] [2025-03-04 09:14:31,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35675727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:31,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456719757] [2025-03-04 09:14:31,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:31,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:31,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:31,848 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-04 09:14:31,849 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-04 09:14:32,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 09:14:32,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 09:14:32,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:32,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:32,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 2009 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 09:14:32,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:32,425 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-04 09:14:32,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:14:32,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 09:14:32,596 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 21 treesize of output 9 [2025-03-04 09:14:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-04 09:14:32,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:32,796 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 33 treesize of output 31 [2025-03-04 09:14:32,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2025-03-04 09:14:32,799 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 50 treesize of output 46 [2025-03-04 09:14:32,803 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 24 [2025-03-04 09:14:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-04 09:14:32,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456719757] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:32,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:32,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2025-03-04 09:14:32,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955958116] [2025-03-04 09:14:32,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:32,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 09:14:32,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:32,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 09:14:32,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-04 09:14:32,860 INFO L87 Difference]: Start difference. First operand 408 states and 422 transitions. Second operand has 21 states, 20 states have (on average 6.1) internal successors, (122), 21 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:33,094 INFO L93 Difference]: Finished difference Result 514 states and 534 transitions. [2025-03-04 09:14:33,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:14:33,095 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.1) internal successors, (122), 21 states have internal predecessors, (122), 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 173 [2025-03-04 09:14:33,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:33,096 INFO L225 Difference]: With dead ends: 514 [2025-03-04 09:14:33,096 INFO L226 Difference]: Without dead ends: 514 [2025-03-04 09:14:33,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-03-04 09:14:33,097 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 219 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:33,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 701 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:14:33,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-04 09:14:33,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 409. [2025-03-04 09:14:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 399 states have (on average 1.055137844611529) internal successors, (421), 406 states have internal predecessors, (421), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 423 transitions. [2025-03-04 09:14:33,101 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 423 transitions. Word has length 173 [2025-03-04 09:14:33,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:33,101 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 423 transitions. [2025-03-04 09:14:33,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.1) internal successors, (122), 21 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:33,101 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 423 transitions. [2025-03-04 09:14:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 09:14:33,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:33,102 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:33,114 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-04 09:14:33,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:33,303 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:33,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:33,303 INFO L85 PathProgramCache]: Analyzing trace with hash -151405975, now seen corresponding path program 1 times [2025-03-04 09:14:33,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:33,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167583678] [2025-03-04 09:14:33,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:33,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:33,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 09:14:33,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 09:14:33,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:33,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 483 proven. 155 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2025-03-04 09:14:34,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:34,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167583678] [2025-03-04 09:14:34,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167583678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:34,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856436028] [2025-03-04 09:14:34,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:34,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:34,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:34,202 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-04 09:14:34,203 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-04 09:14:34,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 09:14:34,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 09:14:34,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:34,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:34,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 2011 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 09:14:34,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:34,771 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 09:14:34,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 09:14:34,808 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 09:14:34,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 09:14:34,824 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2025-03-04 09:14:34,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 09:14:34,841 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-03-04 09:14:34,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2025-03-04 09:14:35,195 INFO L349 Elim1Store]: treesize reduction 36, result has 59.1 percent of original size [2025-03-04 09:14:35,195 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 6 case distinctions, treesize of input 29 treesize of output 66 [2025-03-04 09:14:35,273 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-04 09:14:35,437 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 32 treesize of output 16 [2025-03-04 09:14:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 21 proven. 526 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2025-03-04 09:14:35,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 20 proven. 549 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 09:14:35,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856436028] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:35,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:35,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 11] total 22 [2025-03-04 09:14:35,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532262041] [2025-03-04 09:14:35,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:35,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 09:14:35,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:35,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 09:14:35,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2025-03-04 09:14:35,942 INFO L87 Difference]: Start difference. First operand 409 states and 423 transitions. Second operand has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 09:14:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:35,988 INFO L93 Difference]: Finished difference Result 408 states and 422 transitions. [2025-03-04 09:14:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:14:35,988 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 174 [2025-03-04 09:14:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:35,989 INFO L225 Difference]: With dead ends: 408 [2025-03-04 09:14:35,989 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 09:14:35,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 335 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2025-03-04 09:14:35,990 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 109 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:35,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 52 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:14:35,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 09:14:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-03-04 09:14:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 399 states have (on average 1.0526315789473684) internal successors, (420), 405 states have internal predecessors, (420), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 422 transitions. [2025-03-04 09:14:35,994 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 422 transitions. Word has length 174 [2025-03-04 09:14:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:35,994 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 422 transitions. [2025-03-04 09:14:35,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 09:14:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 422 transitions. [2025-03-04 09:14:35,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 09:14:35,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:35,995 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:36,008 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-04 09:14:36,195 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,SelfDestructingSolverStorable38 [2025-03-04 09:14:36,196 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:36,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:36,197 INFO L85 PathProgramCache]: Analyzing trace with hash -398617835, now seen corresponding path program 1 times [2025-03-04 09:14:36,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:36,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025254103] [2025-03-04 09:14:36,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:36,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:36,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 09:14:36,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 09:14:36,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:36,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-04 09:14:37,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:37,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025254103] [2025-03-04 09:14:37,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025254103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:37,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112204647] [2025-03-04 09:14:37,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:37,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:37,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:37,976 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-04 09:14:37,977 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-04 09:14:38,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 09:14:38,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 09:14:38,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:38,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:38,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 2013 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 09:14:38,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:38,588 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 09:14:38,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 09:14:38,592 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-04 09:14:38,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:38,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:38,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-03-04 09:14:38,711 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-03-04 09:14:38,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2025-03-04 09:14:39,008 INFO L349 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2025-03-04 09:14:39,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 43 [2025-03-04 09:14:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2025-03-04 09:14:39,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:14:39,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112204647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:39,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 09:14:39,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 17 [2025-03-04 09:14:39,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112083853] [2025-03-04 09:14:39,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:39,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:14:39,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:39,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:14:39,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-04 09:14:39,282 INFO L87 Difference]: Start difference. First operand 408 states and 422 transitions. Second operand has 5 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-04 09:14:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:39,346 INFO L93 Difference]: Finished difference Result 407 states and 421 transitions. [2025-03-04 09:14:39,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:14:39,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 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 175 [2025-03-04 09:14:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:39,347 INFO L225 Difference]: With dead ends: 407 [2025-03-04 09:14:39,347 INFO L226 Difference]: Without dead ends: 407 [2025-03-04 09:14:39,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-04 09:14:39,348 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 129 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:39,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 45 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:14:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-04 09:14:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2025-03-04 09:14:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 399 states have (on average 1.050125313283208) internal successors, (419), 404 states have internal predecessors, (419), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 421 transitions. [2025-03-04 09:14:39,352 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 421 transitions. Word has length 175 [2025-03-04 09:14:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:39,352 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 421 transitions. [2025-03-04 09:14:39,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-04 09:14:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 421 transitions. [2025-03-04 09:14:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 09:14:39,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:39,354 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:39,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 09:14:39,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 09:14:39,554 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:39,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:39,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1261039176, now seen corresponding path program 1 times [2025-03-04 09:14:39,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:39,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868530769] [2025-03-04 09:14:39,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:39,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:39,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 09:14:39,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 09:14:39,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:39,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-04 09:14:40,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:40,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868530769] [2025-03-04 09:14:40,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868530769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:40,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444951274] [2025-03-04 09:14:40,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:40,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:40,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:40,510 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:14:40,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 09:14:40,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 09:14:41,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 09:14:41,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:41,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:41,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 2028 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 09:14:41,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:41,089 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:14:41,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:14:41,092 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-04 09:14:41,112 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 23 treesize of output 1 [2025-03-04 09:14:41,444 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 09:14:41,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 09:14:41,450 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:14:41,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:14:41,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:41,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-03-04 09:14:41,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:41,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2025-03-04 09:14:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 1 proven. 568 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 09:14:42,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:42,736 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 09:14:42,736 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 13 treesize of output 12 [2025-03-04 09:14:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 2 proven. 530 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-04 09:14:42,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444951274] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:42,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:42,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 30 [2025-03-04 09:14:42,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709350570] [2025-03-04 09:14:42,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:42,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 09:14:42,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:42,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 09:14:42,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2025-03-04 09:14:42,826 INFO L87 Difference]: Start difference. First operand 407 states and 421 transitions. Second operand has 31 states, 30 states have (on average 5.466666666666667) internal successors, (164), 31 states have internal predecessors, (164), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:43,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:43,364 INFO L93 Difference]: Finished difference Result 495 states and 511 transitions. [2025-03-04 09:14:43,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:14:43,365 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 5.466666666666667) internal successors, (164), 31 states have internal predecessors, (164), 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 180 [2025-03-04 09:14:43,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:43,366 INFO L225 Difference]: With dead ends: 495 [2025-03-04 09:14:43,366 INFO L226 Difference]: Without dead ends: 495 [2025-03-04 09:14:43,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 339 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=326, Invalid=1566, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 09:14:43,367 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 421 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:43,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 768 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 09:14:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-04 09:14:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 408. [2025-03-04 09:14:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 401 states have (on average 1.0498753117206983) internal successors, (421), 405 states have internal predecessors, (421), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 423 transitions. [2025-03-04 09:14:43,371 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 423 transitions. Word has length 180 [2025-03-04 09:14:43,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:43,371 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 423 transitions. [2025-03-04 09:14:43,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 5.466666666666667) internal successors, (164), 31 states have internal predecessors, (164), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 423 transitions. [2025-03-04 09:14:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-04 09:14:43,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:43,372 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:43,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 09:14:43,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:43,574 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:43,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:43,574 INFO L85 PathProgramCache]: Analyzing trace with hash -677870347, now seen corresponding path program 1 times [2025-03-04 09:14:43,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:43,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920546494] [2025-03-04 09:14:43,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:43,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:43,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-04 09:14:43,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 09:14:43,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:43,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-04 09:14:45,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:45,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920546494] [2025-03-04 09:14:45,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920546494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:45,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143776327] [2025-03-04 09:14:45,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:45,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:45,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:45,314 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:14:45,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 09:14:45,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-04 09:14:45,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 09:14:45,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:45,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:45,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 2037 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 09:14:45,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:45,908 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-04 09:14:45,910 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-04 09:14:45,944 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-04 09:14:45,944 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 19 [2025-03-04 09:14:45,955 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-04 09:14:45,955 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 19 [2025-03-04 09:14:46,356 INFO L349 Elim1Store]: treesize reduction 27, result has 28.9 percent of original size [2025-03-04 09:14:46,356 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 31 treesize of output 15 [2025-03-04 09:14:46,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:14:46,361 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 31 treesize of output 15 [2025-03-04 09:14:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-04 09:14:46,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-04 09:14:47,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143776327] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:47,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:47,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 26 [2025-03-04 09:14:47,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449952981] [2025-03-04 09:14:47,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:47,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 09:14:47,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:47,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 09:14:47,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2025-03-04 09:14:47,445 INFO L87 Difference]: Start difference. First operand 408 states and 423 transitions. Second operand has 26 states, 26 states have (on average 5.5) internal successors, (143), 26 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:47,907 INFO L93 Difference]: Finished difference Result 586 states and 604 transitions. [2025-03-04 09:14:47,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:14:47,908 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.5) internal successors, (143), 26 states have internal predecessors, (143), 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 182 [2025-03-04 09:14:47,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:47,909 INFO L225 Difference]: With dead ends: 586 [2025-03-04 09:14:47,909 INFO L226 Difference]: Without dead ends: 586 [2025-03-04 09:14:47,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=1018, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 09:14:47,910 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 516 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:47,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 894 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:14:47,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-04 09:14:47,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 413. [2025-03-04 09:14:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 406 states have (on average 1.0517241379310345) internal successors, (427), 410 states have internal predecessors, (427), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 429 transitions. [2025-03-04 09:14:47,915 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 429 transitions. Word has length 182 [2025-03-04 09:14:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:47,915 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 429 transitions. [2025-03-04 09:14:47,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.5) internal successors, (143), 26 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 429 transitions. [2025-03-04 09:14:47,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 09:14:47,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:47,917 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 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-04 09:14:47,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 09:14:48,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:48,117 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-04 09:14:48,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2138356694, now seen corresponding path program 3 times [2025-03-04 09:14:48,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:48,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346611215] [2025-03-04 09:14:48,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:14:48,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:48,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 185 statements into 23 equivalence classes. [2025-03-04 09:14:50,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 09:14:50,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-03-04 09:14:50,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-04 09:14:50,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:50,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346611215] [2025-03-04 09:14:50,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346611215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:50,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427249244] [2025-03-04 09:14:50,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:14:50,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:50,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:50,655 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:14:50,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 09:14:51,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 185 statements into 23 equivalence classes.