./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 13:29:49,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:29:50,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-17 13:29:50,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:29:50,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:29:50,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:29:50,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:29:50,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:29:50,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:29:50,047 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:29:50,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:29:50,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:29:50,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:29:50,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:29:50,049 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:29:50,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:29:50,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:29:50,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:29:50,049 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:29:50,049 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:29:50,049 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:29:50,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:29:50,049 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:29:50,049 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:29:50,049 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:29:50,049 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:29:50,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:29:50,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:29:50,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:29:50,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:29:50,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:29:50,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:29:50,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:29:50,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 13:29:50,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 13:29:50,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:29:50,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:29:50,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:29:50,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:29:50,050 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-17 13:29:50,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:29:50,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:29:50,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:29:50,284 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:29:50,284 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:29:50,286 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-17 13:29:51,432 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6c264fe2/0ecc54dc58e149b2ae6211616a46500c/FLAGebb2e5b15 [2025-03-17 13:29:51,715 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:29:51,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2025-03-17 13:29:51,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6c264fe2/0ecc54dc58e149b2ae6211616a46500c/FLAGebb2e5b15 [2025-03-17 13:29:51,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6c264fe2/0ecc54dc58e149b2ae6211616a46500c [2025-03-17 13:29:51,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:29:51,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:29:51,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:29:51,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:29:51,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:29:51,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:29:51" (1/1) ... [2025-03-17 13:29:51,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ffefba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:51, skipping insertion in model container [2025-03-17 13:29:51,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:29:51" (1/1) ... [2025-03-17 13:29:51,771 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:29:52,052 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-17 13:29:52,063 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:52,064 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:52,068 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-17 13:29:52,077 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:52,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:29:52,104 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:29:52,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:29:52,240 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:29:52,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:52 WrapperNode [2025-03-17 13:29:52,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:29:52,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:29:52,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:29:52,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:29:52,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:52" (1/1) ... [2025-03-17 13:29:52,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:52" (1/1) ... [2025-03-17 13:29:52,302 INFO L138 Inliner]: procedures = 344, calls = 498, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 648 [2025-03-17 13:29:52,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:29:52,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:29:52,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:29:52,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:29:52,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:52" (1/1) ... [2025-03-17 13:29:52,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:52" (1/1) ... [2025-03-17 13:29:52,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:52" (1/1) ... [2025-03-17 13:29:52,351 INFO L175 MemorySlicer]: Split 450 memory accesses to 15 slices as follows [2, 3, 2, 3, 3, 4, 4, 4, 4, 3, 2, 44, 355, 11, 6]. 79 percent of accesses are in the largest equivalence class. The 423 initializations are split as follows [2, 3, 0, 3, 3, 3, 3, 3, 3, 3, 0, 42, 355, 0, 0]. The 9 writes are split as follows [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 2, 2, 0, 2, 2]. [2025-03-17 13:29:52,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:52" (1/1) ... [2025-03-17 13:29:52,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:52" (1/1) ... [2025-03-17 13:29:52,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:52" (1/1) ... [2025-03-17 13:29:52,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:52" (1/1) ... [2025-03-17 13:29:52,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:52" (1/1) ... [2025-03-17 13:29:52,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:52" (1/1) ... [2025-03-17 13:29:52,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:29:52,391 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:29:52,392 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:29:52,392 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:29:52,392 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:52" (1/1) ... [2025-03-17 13:29:52,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:29:52,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:52,423 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-17 13:29:52,426 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-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 13:29:52,443 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 13:29:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 13:29:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 13:29:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 13:29:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 13:29:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 13:29:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 13:29:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-17 13:29:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-17 13:29:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 13:29:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:29:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 13:29:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 13:29:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 13:29:52,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 13:29:52,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 13:29:52,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 13:29:52,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-17 13:29:52,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-17 13:29:52,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-17 13:29:52,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-17 13:29:52,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:29:52,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:29:52,627 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:29:52,629 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:29:53,119 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1231: havoc single_argv_#t~mem89#1.base, single_argv_#t~mem89#1.offset; [2025-03-17 13:29:53,142 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2025-03-17 13:29:53,143 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:29:53,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:29:53,152 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 13:29:53,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:29:53 BoogieIcfgContainer [2025-03-17 13:29:53,153 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:29:53,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:29:53,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:29:53,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:29:53,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:29:51" (1/3) ... [2025-03-17 13:29:53,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e26e25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:29:53, skipping insertion in model container [2025-03-17 13:29:53,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:52" (2/3) ... [2025-03-17 13:29:53,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e26e25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:29:53, skipping insertion in model container [2025-03-17 13:29:53,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:29:53" (3/3) ... [2025-03-17 13:29:53,159 INFO L128 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2025-03-17 13:29:53,169 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:29:53,170 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dirname-1.i that has 2 procedures, 171 locations, 1 initial locations, 6 loop locations, and 74 error locations. [2025-03-17 13:29:53,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:29:53,202 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;@63001e2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:29:53,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-03-17 13:29:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 94 states have (on average 2.0) internal successors, (188), 168 states have internal predecessors, (188), 1 states have call successors, (1), 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-17 13:29:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:29:53,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:53,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:29:53,209 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-17 13:29:53,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:53,212 INFO L85 PathProgramCache]: Analyzing trace with hash 7039, now seen corresponding path program 1 times [2025-03-17 13:29:53,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:53,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300752254] [2025-03-17 13:29:53,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:53,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:53,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:29:53,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:29:53,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:53,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:53,697 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-17 13:29:53,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:53,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300752254] [2025-03-17 13:29:53,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300752254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:53,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:53,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:29:53,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024135364] [2025-03-17 13:29:53,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:53,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:29:53,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:53,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:29:53,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:53,724 INFO L87 Difference]: Start difference. First operand has 171 states, 94 states have (on average 2.0) internal successors, (188), 168 states have internal predecessors, (188), 1 states have call successors, (1), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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-17 13:29:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:53,834 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2025-03-17 13:29:53,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:29:53,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2025-03-17 13:29:53,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:53,845 INFO L225 Difference]: With dead ends: 133 [2025-03-17 13:29:53,845 INFO L226 Difference]: Without dead ends: 133 [2025-03-17 13:29:53,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 13:29:53,848 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 137 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:53,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 91 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-17 13:29:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-17 13:29:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 76 states have (on average 1.9078947368421053) internal successors, (145), 130 states have internal predecessors, (145), 1 states have call successors, (1), 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-17 13:29:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2025-03-17 13:29:53,874 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 2 [2025-03-17 13:29:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:53,875 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2025-03-17 13:29:53,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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-17 13:29:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2025-03-17 13:29:53,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:29:53,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:53,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:29:53,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 13:29:53,876 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-17 13:29:53,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:53,876 INFO L85 PathProgramCache]: Analyzing trace with hash 7040, now seen corresponding path program 1 times [2025-03-17 13:29:53,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:53,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34356580] [2025-03-17 13:29:53,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:53,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:53,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:29:53,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:29:53,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:53,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:54,108 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-17 13:29:54,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:54,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34356580] [2025-03-17 13:29:54,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34356580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:54,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:54,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:29:54,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347689651] [2025-03-17 13:29:54,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:54,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:29:54,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:54,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:29:54,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:54,112 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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-17 13:29:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:54,191 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2025-03-17 13:29:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:29:54,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2025-03-17 13:29:54,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:54,192 INFO L225 Difference]: With dead ends: 132 [2025-03-17 13:29:54,193 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 13:29:54,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 13:29:54,193 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:54,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 223 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 13:29:54,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-17 13:29:54,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 76 states have (on average 1.894736842105263) internal successors, (144), 129 states have internal predecessors, (144), 1 states have call successors, (1), 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-17 13:29:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2025-03-17 13:29:54,200 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 2 [2025-03-17 13:29:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:54,200 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2025-03-17 13:29:54,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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-17 13:29:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2025-03-17 13:29:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 13:29:54,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:54,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 13:29:54,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 13:29:54,201 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-17 13:29:54,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:54,201 INFO L85 PathProgramCache]: Analyzing trace with hash 209853723, now seen corresponding path program 1 times [2025-03-17 13:29:54,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:54,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355820410] [2025-03-17 13:29:54,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:54,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:54,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 13:29:54,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 13:29:54,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:54,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:54,428 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-17 13:29:54,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:54,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355820410] [2025-03-17 13:29:54,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355820410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:54,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:54,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:29:54,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236853073] [2025-03-17 13:29:54,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:54,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:29:54,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:54,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:29:54,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:29:54,430 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:54,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:54,537 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2025-03-17 13:29:54,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:29:54,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 13:29:54,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:54,539 INFO L225 Difference]: With dead ends: 135 [2025-03-17 13:29:54,539 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 13:29:54,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-17 13:29:54,539 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 7 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:54,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 221 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:54,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 13:29:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2025-03-17 13:29:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 131 states have internal predecessors, (146), 1 states have call successors, (1), 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-17 13:29:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2025-03-17 13:29:54,548 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 5 [2025-03-17 13:29:54,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:54,548 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2025-03-17 13:29:54,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2025-03-17 13:29:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 13:29:54,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:54,548 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:54,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 13:29:54,548 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-17 13:29:54,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:54,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1720000805, now seen corresponding path program 1 times [2025-03-17 13:29:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:54,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658792] [2025-03-17 13:29:54,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:54,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:29:54,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:29:54,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:54,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:54,797 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-17 13:29:54,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:54,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658792] [2025-03-17 13:29:54,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:29:54,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237077741] [2025-03-17 13:29:54,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:54,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:54,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:54,801 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-17 13:29:54,802 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-17 13:29:54,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:29:55,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:29:55,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:55,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:55,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 13:29:55,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:29:55,093 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-17 13:29:55,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:29:55,180 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-17 13:29:55,190 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-17 13:29:55,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237077741] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:29:55,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:29:55,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-17 13:29:55,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265881334] [2025-03-17 13:29:55,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:29:55,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:29:55,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:55,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:29:55,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:29:55,191 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:55,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:55,369 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2025-03-17 13:29:55,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:29:55,370 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 13:29:55,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:55,371 INFO L225 Difference]: With dead ends: 138 [2025-03-17 13:29:55,371 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 13:29:55,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 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-17 13:29:55,372 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 145 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:55,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 393 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 13:29:55,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-17 13:29:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 83 states have (on average 1.8072289156626506) internal successors, (150), 135 states have internal predecessors, (150), 1 states have call successors, (1), 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-17 13:29:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2025-03-17 13:29:55,377 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 8 [2025-03-17 13:29:55,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:55,377 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2025-03-17 13:29:55,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2025-03-17 13:29:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 13:29:55,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:55,378 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:55,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 13:29:55,578 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-17 13:29:55,579 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-17 13:29:55,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:55,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1143107811, now seen corresponding path program 1 times [2025-03-17 13:29:55,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:55,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087878229] [2025-03-17 13:29:55,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:55,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:55,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 13:29:55,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 13:29:55,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:55,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:55,772 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-17 13:29:55,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:55,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087878229] [2025-03-17 13:29:55,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087878229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:29:55,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686721020] [2025-03-17 13:29:55,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:55,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:55,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:55,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:29:55,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 13:29:55,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 13:29:55,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 13:29:55,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:55,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:55,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 13:29:55,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:29:56,004 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-17 13:29:56,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:29:56,061 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-17 13:29:56,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686721020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:29:56,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:29:56,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-17 13:29:56,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972218975] [2025-03-17 13:29:56,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:29:56,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 13:29:56,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:56,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 13:29:56,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:29:56,063 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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-17 13:29:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:56,115 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2025-03-17 13:29:56,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 13:29:56,116 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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 20 [2025-03-17 13:29:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:56,116 INFO L225 Difference]: With dead ends: 153 [2025-03-17 13:29:56,116 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 13:29:56,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 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-17 13:29:56,117 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 4 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 559 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-17 13:29:56,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 559 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:29:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 13:29:56,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-03-17 13:29:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.683673469387755) internal successors, (165), 150 states have internal predecessors, (165), 1 states have call successors, (1), 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-17 13:29:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2025-03-17 13:29:56,126 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 20 [2025-03-17 13:29:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:56,129 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2025-03-17 13:29:56,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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-17 13:29:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2025-03-17 13:29:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 13:29:56,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:56,130 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:56,139 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-17 13:29:56,331 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-17 13:29:56,331 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-17 13:29:56,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:56,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1293203677, now seen corresponding path program 2 times [2025-03-17 13:29:56,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:56,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106837940] [2025-03-17 13:29:56,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:29:56,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:56,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-17 13:29:56,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 35 statements. [2025-03-17 13:29:56,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 13:29:56,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:56,480 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-17 13:29:56,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:56,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106837940] [2025-03-17 13:29:56,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106837940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:56,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:56,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:29:56,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146714703] [2025-03-17 13:29:56,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:56,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:29:56,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:56,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:29:56,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:56,482 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 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-17 13:29:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:56,555 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2025-03-17 13:29:56,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:29:56,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 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 35 [2025-03-17 13:29:56,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:56,556 INFO L225 Difference]: With dead ends: 148 [2025-03-17 13:29:56,556 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 13:29:56,556 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-17 13:29:56,557 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 121 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:56,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 95 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:56,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 13:29:56,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-17 13:29:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 98 states have (on average 1.6326530612244898) internal successors, (160), 145 states have internal predecessors, (160), 1 states have call successors, (1), 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-17 13:29:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2025-03-17 13:29:56,564 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 35 [2025-03-17 13:29:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:56,564 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2025-03-17 13:29:56,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 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-17 13:29:56,564 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2025-03-17 13:29:56,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 13:29:56,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:56,565 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:56,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 13:29:56,565 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-17 13:29:56,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:56,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1293203676, now seen corresponding path program 1 times [2025-03-17 13:29:56,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:56,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618370537] [2025-03-17 13:29:56,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:56,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:56,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 13:29:56,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 13:29:56,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:56,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:56,879 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-17 13:29:56,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:56,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618370537] [2025-03-17 13:29:56,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618370537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:29:56,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167242309] [2025-03-17 13:29:56,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:56,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:56,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:56,882 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-17 13:29:56,884 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-17 13:29:56,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 13:29:57,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 13:29:57,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:57,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:57,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 13:29:57,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:29:57,136 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-17 13:29:57,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:29:57,224 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-17 13:29:57,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167242309] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:29:57,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:29:57,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-03-17 13:29:57,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288784042] [2025-03-17 13:29:57,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:29:57,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 13:29:57,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:57,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 13:29:57,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:29:57,227 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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-17 13:29:57,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:57,275 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2025-03-17 13:29:57,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:29:57,276 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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 35 [2025-03-17 13:29:57,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:57,277 INFO L225 Difference]: With dead ends: 154 [2025-03-17 13:29:57,277 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 13:29:57,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 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-17 13:29:57,278 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 2 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:57,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:29:57,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 13:29:57,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-17 13:29:57,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 104 states have (on average 1.5961538461538463) internal successors, (166), 151 states have internal predecessors, (166), 1 states have call successors, (1), 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-17 13:29:57,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2025-03-17 13:29:57,286 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 35 [2025-03-17 13:29:57,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:57,287 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2025-03-17 13:29:57,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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-17 13:29:57,287 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2025-03-17 13:29:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 13:29:57,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:57,287 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:57,296 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-17 13:29:57,487 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-17 13:29:57,488 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-17 13:29:57,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash 673771300, now seen corresponding path program 2 times [2025-03-17 13:29:57,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:57,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898811932] [2025-03-17 13:29:57,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:29:57,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:57,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-17 13:29:57,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 41 statements. [2025-03-17 13:29:57,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 13:29:57,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:57,821 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-17 13:29:57,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:57,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898811932] [2025-03-17 13:29:57,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898811932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:57,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:57,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:29:57,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729075659] [2025-03-17 13:29:57,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:57,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:29:57,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:57,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:29:57,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:29:57,822 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 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-17 13:29:57,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:57,987 INFO L93 Difference]: Finished difference Result 241 states and 267 transitions. [2025-03-17 13:29:57,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:29:57,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 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 41 [2025-03-17 13:29:57,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:57,988 INFO L225 Difference]: With dead ends: 241 [2025-03-17 13:29:57,988 INFO L226 Difference]: Without dead ends: 241 [2025-03-17 13:29:57,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-17 13:29:57,989 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 226 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:57,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 372 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:29:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-17 13:29:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 153. [2025-03-17 13:29:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 104 states have (on average 1.5865384615384615) internal successors, (165), 150 states have internal predecessors, (165), 1 states have call successors, (1), 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-17 13:29:57,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2025-03-17 13:29:57,996 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 41 [2025-03-17 13:29:57,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:57,996 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2025-03-17 13:29:57,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 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-17 13:29:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2025-03-17 13:29:57,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 13:29:57,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:57,998 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:57,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 13:29:57,999 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:29:57,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:57,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1938736330, now seen corresponding path program 1 times [2025-03-17 13:29:57,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:57,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846716359] [2025-03-17 13:29:57,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:57,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:58,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 13:29:58,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 13:29:58,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:58,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:58,148 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-17 13:29:58,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:58,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846716359] [2025-03-17 13:29:58,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846716359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:58,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:58,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:29:58,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024719010] [2025-03-17 13:29:58,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:58,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:29:58,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:58,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:29:58,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:29:58,150 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:58,231 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2025-03-17 13:29:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:29:58,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-17 13:29:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:58,232 INFO L225 Difference]: With dead ends: 147 [2025-03-17 13:29:58,232 INFO L226 Difference]: Without dead ends: 147 [2025-03-17 13:29:58,232 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-17 13:29:58,233 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 184 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:58,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 116 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:58,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-17 13:29:58,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-17 13:29:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 104 states have (on average 1.5288461538461537) internal successors, (159), 144 states have internal predecessors, (159), 1 states have call successors, (1), 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-17 13:29:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2025-03-17 13:29:58,236 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 44 [2025-03-17 13:29:58,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:58,236 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2025-03-17 13:29:58,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:58,236 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2025-03-17 13:29:58,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 13:29:58,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:58,236 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:58,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 13:29:58,237 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:29:58,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:58,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1938736331, now seen corresponding path program 1 times [2025-03-17 13:29:58,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:58,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684378976] [2025-03-17 13:29:58,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:58,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:58,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 13:29:58,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 13:29:58,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:58,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:58,445 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-17 13:29:58,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:58,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684378976] [2025-03-17 13:29:58,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684378976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:58,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:58,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:29:58,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395868861] [2025-03-17 13:29:58,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:58,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:29:58,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:58,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:29:58,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:29:58,447 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:58,508 INFO L93 Difference]: Finished difference Result 166 states and 186 transitions. [2025-03-17 13:29:58,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:29:58,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-17 13:29:58,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:58,510 INFO L225 Difference]: With dead ends: 166 [2025-03-17 13:29:58,510 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 13:29:58,510 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-17 13:29:58,511 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 162 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:58,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 456 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 13:29:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 148. [2025-03-17 13:29:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.5238095238095237) internal successors, (160), 145 states have internal predecessors, (160), 1 states have call successors, (1), 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-17 13:29:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2025-03-17 13:29:58,514 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 44 [2025-03-17 13:29:58,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:58,515 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2025-03-17 13:29:58,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2025-03-17 13:29:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 13:29:58,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:58,516 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:58,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 13:29:58,516 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:29:58,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:58,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1938737259, now seen corresponding path program 1 times [2025-03-17 13:29:58,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:58,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238683660] [2025-03-17 13:29:58,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:58,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:58,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 13:29:58,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 13:29:58,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:58,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:58,821 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-17 13:29:58,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:58,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238683660] [2025-03-17 13:29:58,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238683660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:58,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:58,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:29:58,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564050684] [2025-03-17 13:29:58,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:58,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:29:58,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:58,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:29:58,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:29:58,822 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:58,992 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2025-03-17 13:29:58,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:29:58,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-17 13:29:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:58,993 INFO L225 Difference]: With dead ends: 166 [2025-03-17 13:29:58,993 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 13:29:58,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:29:58,994 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 133 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:58,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 196 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:29:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 13:29:58,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 161. [2025-03-17 13:29:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 118 states have (on average 1.5254237288135593) internal successors, (180), 158 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-17 13:29:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 182 transitions. [2025-03-17 13:29:58,999 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 182 transitions. Word has length 44 [2025-03-17 13:29:58,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:58,999 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 182 transitions. [2025-03-17 13:29:58,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:58,999 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 182 transitions. [2025-03-17 13:29:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 13:29:58,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:59,000 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:59,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 13:29:59,000 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-17 13:29:59,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:59,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1798405602, now seen corresponding path program 1 times [2025-03-17 13:29:59,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:59,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677782169] [2025-03-17 13:29:59,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:59,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:59,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 13:29:59,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 13:29:59,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:59,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:59,201 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-17 13:29:59,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:59,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677782169] [2025-03-17 13:29:59,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677782169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:59,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:59,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:29:59,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427287752] [2025-03-17 13:29:59,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:59,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:29:59,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:59,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:29:59,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:59,203 INFO L87 Difference]: Start difference. First operand 161 states and 182 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:59,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:59,253 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2025-03-17 13:29:59,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:29:59,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-17 13:29:59,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:59,255 INFO L225 Difference]: With dead ends: 160 [2025-03-17 13:29:59,256 INFO L226 Difference]: Without dead ends: 160 [2025-03-17 13:29:59,256 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-17 13:29:59,257 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 112 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:59,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 99 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:29:59,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-17 13:29:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-03-17 13:29:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 118 states have (on average 1.5084745762711864) internal successors, (178), 157 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-17 13:29:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 180 transitions. [2025-03-17 13:29:59,261 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 180 transitions. Word has length 47 [2025-03-17 13:29:59,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:59,261 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 180 transitions. [2025-03-17 13:29:59,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 180 transitions. [2025-03-17 13:29:59,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 13:29:59,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:59,263 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:59,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 13:29:59,263 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-17 13:29:59,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:59,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1798405601, now seen corresponding path program 1 times [2025-03-17 13:29:59,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:59,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824908068] [2025-03-17 13:29:59,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:59,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:59,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 13:29:59,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 13:29:59,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:59,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:59,769 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-17 13:29:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:59,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824908068] [2025-03-17 13:29:59,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824908068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:59,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:59,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 13:29:59,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136963830] [2025-03-17 13:29:59,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:59,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 13:29:59,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:59,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 13:29:59,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 13:29:59,772 INFO L87 Difference]: Start difference. First operand 160 states and 180 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:00,034 INFO L93 Difference]: Finished difference Result 164 states and 179 transitions. [2025-03-17 13:30:00,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 13:30:00,034 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-17 13:30:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:00,035 INFO L225 Difference]: With dead ends: 164 [2025-03-17 13:30:00,035 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 13:30:00,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-17 13:30:00,036 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 161 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:00,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 297 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:30:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 13:30:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2025-03-17 13:30:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 118 states have (on average 1.5) internal successors, (177), 157 states have internal predecessors, (177), 1 states have call successors, (1), 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-17 13:30:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2025-03-17 13:30:00,039 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 47 [2025-03-17 13:30:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:00,039 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2025-03-17 13:30:00,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2025-03-17 13:30:00,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 13:30:00,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:00,039 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:00,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 13:30:00,040 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-17 13:30:00,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:00,040 INFO L85 PathProgramCache]: Analyzing trace with hash -879107901, now seen corresponding path program 1 times [2025-03-17 13:30:00,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:00,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014525585] [2025-03-17 13:30:00,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:00,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:00,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 13:30:00,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 13:30:00,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:00,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:00,239 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-17 13:30:00,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:00,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014525585] [2025-03-17 13:30:00,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014525585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:00,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:00,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:30:00,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471433140] [2025-03-17 13:30:00,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:00,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:30:00,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:00,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:30:00,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:30:00,240 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:00,344 INFO L93 Difference]: Finished difference Result 159 states and 177 transitions. [2025-03-17 13:30:00,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:30:00,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-17 13:30:00,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:00,346 INFO L225 Difference]: With dead ends: 159 [2025-03-17 13:30:00,346 INFO L226 Difference]: Without dead ends: 159 [2025-03-17 13:30:00,346 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-17 13:30:00,346 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 12 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:00,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 347 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:30:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-17 13:30:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-17 13:30:00,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 156 states have internal predecessors, (175), 1 states have call successors, (1), 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-17 13:30:00,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2025-03-17 13:30:00,349 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 50 [2025-03-17 13:30:00,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:00,349 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2025-03-17 13:30:00,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:00,350 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2025-03-17 13:30:00,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 13:30:00,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:00,350 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:00,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 13:30:00,350 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-17 13:30:00,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:00,351 INFO L85 PathProgramCache]: Analyzing trace with hash -879107900, now seen corresponding path program 1 times [2025-03-17 13:30:00,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:00,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392612092] [2025-03-17 13:30:00,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:00,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:00,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 13:30:00,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 13:30:00,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:00,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:00,772 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-17 13:30:00,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:00,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392612092] [2025-03-17 13:30:00,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392612092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:00,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:00,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:30:00,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656526379] [2025-03-17 13:30:00,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:00,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:30:00,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:00,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:30:00,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:30:00,773 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:00,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:00,900 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2025-03-17 13:30:00,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:30:00,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-17 13:30:00,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:00,901 INFO L225 Difference]: With dead ends: 158 [2025-03-17 13:30:00,901 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 13:30:00,901 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-17 13:30:00,902 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 11 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:00,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 327 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:30:00,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 13:30:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-17 13:30:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 155 states have internal predecessors, (173), 1 states have call successors, (1), 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-17 13:30:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2025-03-17 13:30:00,906 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 50 [2025-03-17 13:30:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:00,907 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2025-03-17 13:30:00,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2025-03-17 13:30:00,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 13:30:00,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:00,907 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] [2025-03-17 13:30:00,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 13:30:00,907 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:30:00,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:00,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1231005801, now seen corresponding path program 1 times [2025-03-17 13:30:00,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:00,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477084471] [2025-03-17 13:30:00,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:00,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:00,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 13:30:00,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 13:30:00,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:00,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:01,001 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:01,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:01,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477084471] [2025-03-17 13:30:01,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477084471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:01,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:01,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:30:01,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836768237] [2025-03-17 13:30:01,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:01,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:01,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:01,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:01,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:01,002 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 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-17 13:30:01,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:01,022 INFO L93 Difference]: Finished difference Result 170 states and 190 transitions. [2025-03-17 13:30:01,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:01,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 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 54 [2025-03-17 13:30:01,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:01,023 INFO L225 Difference]: With dead ends: 170 [2025-03-17 13:30:01,023 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 13:30:01,023 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-17 13:30:01,024 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 6 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 249 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-17 13:30:01,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 249 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:01,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 13:30:01,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 160. [2025-03-17 13:30:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 120 states have (on average 1.4583333333333333) internal successors, (175), 157 states have internal predecessors, (175), 1 states have call successors, (1), 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-17 13:30:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 177 transitions. [2025-03-17 13:30:01,027 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 177 transitions. Word has length 54 [2025-03-17 13:30:01,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:01,027 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 177 transitions. [2025-03-17 13:30:01,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 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-17 13:30:01,027 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 177 transitions. [2025-03-17 13:30:01,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 13:30:01,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:01,028 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] [2025-03-17 13:30:01,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 13:30:01,028 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-17 13:30:01,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:01,028 INFO L85 PathProgramCache]: Analyzing trace with hash 493801044, now seen corresponding path program 1 times [2025-03-17 13:30:01,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:01,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981328964] [2025-03-17 13:30:01,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:01,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:01,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 13:30:01,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 13:30:01,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:01,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:01,141 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-17 13:30:01,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:01,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981328964] [2025-03-17 13:30:01,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981328964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:01,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:01,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:30:01,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964111635] [2025-03-17 13:30:01,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:01,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:30:01,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:01,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:30:01,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:30:01,143 INFO L87 Difference]: Start difference. First operand 160 states and 177 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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-17 13:30:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:01,233 INFO L93 Difference]: Finished difference Result 159 states and 175 transitions. [2025-03-17 13:30:01,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:30:01,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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-17 13:30:01,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:01,234 INFO L225 Difference]: With dead ends: 159 [2025-03-17 13:30:01,234 INFO L226 Difference]: Without dead ends: 159 [2025-03-17 13:30:01,235 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-17 13:30:01,235 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 5 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:01,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 380 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:30:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-17 13:30:01,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-17 13:30:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 120 states have (on average 1.4416666666666667) internal successors, (173), 156 states have internal predecessors, (173), 1 states have call successors, (1), 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-17 13:30:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 175 transitions. [2025-03-17 13:30:01,238 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 175 transitions. Word has length 55 [2025-03-17 13:30:01,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:01,239 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 175 transitions. [2025-03-17 13:30:01,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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-17 13:30:01,239 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 175 transitions. [2025-03-17 13:30:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 13:30:01,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:01,239 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] [2025-03-17 13:30:01,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 13:30:01,240 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-17 13:30:01,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:01,240 INFO L85 PathProgramCache]: Analyzing trace with hash 493801045, now seen corresponding path program 1 times [2025-03-17 13:30:01,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:01,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245576714] [2025-03-17 13:30:01,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:01,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:01,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 13:30:01,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 13:30:01,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:01,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:01,704 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-17 13:30:01,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:01,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245576714] [2025-03-17 13:30:01,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245576714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:01,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:01,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:30:01,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576839016] [2025-03-17 13:30:01,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:01,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:30:01,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:01,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:30:01,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:30:01,706 INFO L87 Difference]: Start difference. First operand 159 states and 175 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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-17 13:30:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:01,854 INFO L93 Difference]: Finished difference Result 167 states and 184 transitions. [2025-03-17 13:30:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 13:30:01,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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-17 13:30:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:01,856 INFO L225 Difference]: With dead ends: 167 [2025-03-17 13:30:01,856 INFO L226 Difference]: Without dead ends: 167 [2025-03-17 13:30:01,856 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-17 13:30:01,857 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 14 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:01,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 324 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:30:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-17 13:30:01,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2025-03-17 13:30:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 126 states have (on average 1.4285714285714286) internal successors, (180), 162 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-17 13:30:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 182 transitions. [2025-03-17 13:30:01,861 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 182 transitions. Word has length 55 [2025-03-17 13:30:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:01,861 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 182 transitions. [2025-03-17 13:30:01,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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-17 13:30:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 182 transitions. [2025-03-17 13:30:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 13:30:01,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:01,863 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:01,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 13:30:01,863 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:30:01,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:01,864 INFO L85 PathProgramCache]: Analyzing trace with hash 305003857, now seen corresponding path program 1 times [2025-03-17 13:30:01,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:01,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857970855] [2025-03-17 13:30:01,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:01,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:01,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 13:30:01,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 13:30:01,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:01,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:01,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:01,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857970855] [2025-03-17 13:30:01,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857970855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:01,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298051788] [2025-03-17 13:30:01,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:01,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:01,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:01,961 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-17 13:30:01,963 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-17 13:30:02,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 13:30:02,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 13:30:02,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:02,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:02,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 13:30:02,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:02,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:02,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298051788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:02,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:02,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 13:30:02,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682900945] [2025-03-17 13:30:02,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:02,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:30:02,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:02,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:30:02,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:30:02,286 INFO L87 Difference]: Start difference. First operand 165 states and 182 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 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-17 13:30:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:02,318 INFO L93 Difference]: Finished difference Result 192 states and 212 transitions. [2025-03-17 13:30:02,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:30:02,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 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 59 [2025-03-17 13:30:02,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:02,320 INFO L225 Difference]: With dead ends: 192 [2025-03-17 13:30:02,320 INFO L226 Difference]: Without dead ends: 192 [2025-03-17 13:30:02,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 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-17 13:30:02,320 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 14 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:02,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 491 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:02,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-17 13:30:02,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2025-03-17 13:30:02,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 150 states have (on average 1.4) internal successors, (210), 186 states have internal predecessors, (210), 1 states have call successors, (1), 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-17 13:30:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 212 transitions. [2025-03-17 13:30:02,325 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 212 transitions. Word has length 59 [2025-03-17 13:30:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:02,325 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 212 transitions. [2025-03-17 13:30:02,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 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-17 13:30:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 212 transitions. [2025-03-17 13:30:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 13:30:02,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:02,328 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] [2025-03-17 13:30:02,337 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-17 13:30:02,528 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-17 13:30:02,528 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-17 13:30:02,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:02,529 INFO L85 PathProgramCache]: Analyzing trace with hash 865460187, now seen corresponding path program 1 times [2025-03-17 13:30:02,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:02,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639832665] [2025-03-17 13:30:02,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:02,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:02,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 13:30:02,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 13:30:02,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:02,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:03,055 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-17 13:30:03,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:03,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639832665] [2025-03-17 13:30:03,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639832665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:03,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158657704] [2025-03-17 13:30:03,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:03,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:03,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:03,058 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-17 13:30:03,060 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-17 13:30:03,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 13:30:03,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 13:30:03,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:03,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:03,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 13:30:03,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:03,328 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-17 13:30:03,348 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-17 13:30:03,350 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-17 13:30:03,491 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-17 13:30:03,496 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-17 13:30:03,520 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-17 13:30:03,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:03,709 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-17 13:30:03,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158657704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:03,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:03,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-03-17 13:30:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036782933] [2025-03-17 13:30:03,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:03,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 13:30:03,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:03,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 13:30:03,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2025-03-17 13:30:03,710 INFO L87 Difference]: Start difference. First operand 189 states and 212 transitions. Second operand has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 1 states have call successors, (1), 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-17 13:30:04,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:04,122 INFO L93 Difference]: Finished difference Result 188 states and 206 transitions. [2025-03-17 13:30:04,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:30:04,123 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 1 states have call successors, (1), 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-17 13:30:04,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:04,123 INFO L225 Difference]: With dead ends: 188 [2025-03-17 13:30:04,123 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 13:30:04,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2025-03-17 13:30:04,124 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 40 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:04,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 738 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:30:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 13:30:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-03-17 13:30:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 150 states have (on average 1.36) internal successors, (204), 185 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-17 13:30:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 206 transitions. [2025-03-17 13:30:04,127 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 206 transitions. Word has length 60 [2025-03-17 13:30:04,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:04,128 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 206 transitions. [2025-03-17 13:30:04,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 1 states have call successors, (1), 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-17 13:30:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 206 transitions. [2025-03-17 13:30:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 13:30:04,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:04,128 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 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] [2025-03-17 13:30:04,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 13:30:04,328 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-17 13:30:04,329 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:30:04,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:04,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1186918377, now seen corresponding path program 2 times [2025-03-17 13:30:04,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:04,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115907602] [2025-03-17 13:30:04,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:30:04,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:04,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-03-17 13:30:04,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 13:30:04,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 13:30:04,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:04,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:04,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115907602] [2025-03-17 13:30:04,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115907602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:04,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161356341] [2025-03-17 13:30:04,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:30:04,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:04,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:04,527 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-17 13:30:04,528 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-17 13:30:04,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-03-17 13:30:04,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 13:30:04,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 13:30:04,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:04,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 1436 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 13:30:04,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:04,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:04,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161356341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:04,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:04,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 13:30:04,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979637447] [2025-03-17 13:30:04,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:04,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 13:30:04,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:04,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 13:30:04,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:30:04,910 INFO L87 Difference]: Start difference. First operand 188 states and 206 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:04,956 INFO L93 Difference]: Finished difference Result 257 states and 272 transitions. [2025-03-17 13:30:04,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:30:04,956 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2025-03-17 13:30:04,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:04,957 INFO L225 Difference]: With dead ends: 257 [2025-03-17 13:30:04,957 INFO L226 Difference]: Without dead ends: 257 [2025-03-17 13:30:04,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 142 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-17 13:30:04,959 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 24 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:04,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 750 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-17 13:30:04,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 248. [2025-03-17 13:30:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 210 states have (on average 1.2857142857142858) internal successors, (270), 245 states have internal predecessors, (270), 1 states have call successors, (1), 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-17 13:30:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 272 transitions. [2025-03-17 13:30:04,965 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 272 transitions. Word has length 74 [2025-03-17 13:30:04,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:04,965 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 272 transitions. [2025-03-17 13:30:04,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 272 transitions. [2025-03-17 13:30:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 13:30:04,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:04,966 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] [2025-03-17 13:30:04,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 13:30:05,166 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-17 13:30:05,166 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:30:05,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:05,167 INFO L85 PathProgramCache]: Analyzing trace with hash 808176855, now seen corresponding path program 3 times [2025-03-17 13:30:05,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:05,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442803801] [2025-03-17 13:30:05,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 13:30:05,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:05,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 12 equivalence classes. [2025-03-17 13:30:05,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 104 statements. [2025-03-17 13:30:05,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 13:30:05,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:05,497 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-17 13:30:05,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:05,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442803801] [2025-03-17 13:30:05,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442803801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:05,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290079530] [2025-03-17 13:30:05,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 13:30:05,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:05,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:05,500 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-17 13:30:05,501 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-17 13:30:05,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 12 equivalence classes. [2025-03-17 13:30:05,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 104 statements. [2025-03-17 13:30:05,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 13:30:05,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:05,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 13:30:05,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:05,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:05,837 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-17 13:30:05,846 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:30:05,847 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-17 13:30:06,019 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-17 13:30:06,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:06,319 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-17 13:30:06,342 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-17 13:30:06,343 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-17 13:30:06,372 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-17 13:30:06,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290079530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:06,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:06,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-03-17 13:30:06,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186284699] [2025-03-17 13:30:06,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:06,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 13:30:06,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:06,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 13:30:06,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-03-17 13:30:06,374 INFO L87 Difference]: Start difference. First operand 248 states and 272 transitions. Second operand has 19 states, 18 states have (on average 3.888888888888889) internal successors, (70), 19 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:06,752 INFO L93 Difference]: Finished difference Result 252 states and 279 transitions. [2025-03-17 13:30:06,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 13:30:06,753 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.888888888888889) internal successors, (70), 19 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2025-03-17 13:30:06,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:06,754 INFO L225 Difference]: With dead ends: 252 [2025-03-17 13:30:06,754 INFO L226 Difference]: Without dead ends: 252 [2025-03-17 13:30:06,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2025-03-17 13:30:06,755 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 630 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:06,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 419 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:30:06,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-17 13:30:06,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 247. [2025-03-17 13:30:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 213 states have (on average 1.2629107981220657) internal successors, (269), 244 states have internal predecessors, (269), 1 states have call successors, (1), 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-17 13:30:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 271 transitions. [2025-03-17 13:30:06,760 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 271 transitions. Word has length 104 [2025-03-17 13:30:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:06,761 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 271 transitions. [2025-03-17 13:30:06,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.888888888888889) internal successors, (70), 19 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 271 transitions. [2025-03-17 13:30:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 13:30:06,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:06,761 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] [2025-03-17 13:30:06,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 13:30:06,962 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-17 13:30:06,962 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:30:06,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:06,963 INFO L85 PathProgramCache]: Analyzing trace with hash 808177783, now seen corresponding path program 1 times [2025-03-17 13:30:06,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:06,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428076065] [2025-03-17 13:30:06,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:06,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:06,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 13:30:07,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 13:30:07,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:07,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:07,453 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-17 13:30:07,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:07,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428076065] [2025-03-17 13:30:07,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428076065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:07,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966873523] [2025-03-17 13:30:07,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:07,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:07,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:07,456 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-17 13:30:07,460 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-17 13:30:07,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 13:30:07,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 13:30:07,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:07,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:07,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 1602 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 13:30:07,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:07,853 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 13:30:07,854 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-17 13:30:07,866 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:30:07,867 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-17 13:30:07,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 13:30:08,328 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-17 13:30:08,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:08,373 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-17 13:30:08,385 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:30:08,386 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-17 13:30:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-17 13:30:08,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:09,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:30:09,166 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-17 13:30:09,256 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-17 13:30:09,275 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-17 13:30:09,275 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-17 13:30:09,298 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-17 13:30:09,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966873523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:09,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:09,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2025-03-17 13:30:09,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311243155] [2025-03-17 13:30:09,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:09,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 13:30:09,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:09,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 13:30:09,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-17 13:30:09,300 INFO L87 Difference]: Start difference. First operand 247 states and 271 transitions. Second operand has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 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-17 13:30:09,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:09,691 INFO L93 Difference]: Finished difference Result 303 states and 321 transitions. [2025-03-17 13:30:09,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 13:30:09,691 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 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 104 [2025-03-17 13:30:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:09,692 INFO L225 Difference]: With dead ends: 303 [2025-03-17 13:30:09,692 INFO L226 Difference]: Without dead ends: 303 [2025-03-17 13:30:09,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2025-03-17 13:30:09,693 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 464 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:09,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 494 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:30:09,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-17 13:30:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 188. [2025-03-17 13:30:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 158 states have (on average 1.2658227848101267) internal successors, (200), 185 states have internal predecessors, (200), 1 states have call successors, (1), 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-17 13:30:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 202 transitions. [2025-03-17 13:30:09,697 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 202 transitions. Word has length 104 [2025-03-17 13:30:09,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:09,697 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 202 transitions. [2025-03-17 13:30:09,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 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-17 13:30:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 202 transitions. [2025-03-17 13:30:09,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 13:30:09,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:09,698 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] [2025-03-17 13:30:09,709 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-17 13:30:09,902 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-17 13:30:09,902 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-17 13:30:09,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:09,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1162219885, now seen corresponding path program 1 times [2025-03-17 13:30:09,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:09,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215296750] [2025-03-17 13:30:09,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:09,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:09,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 13:30:09,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 13:30:09,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:09,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:10,811 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-17 13:30:10,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:10,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215296750] [2025-03-17 13:30:10,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215296750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:10,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37923909] [2025-03-17 13:30:10,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:10,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:10,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:10,814 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-17 13:30:10,815 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-17 13:30:11,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 13:30:11,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 13:30:11,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:11,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:11,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 1627 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 13:30:11,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:11,143 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-17 13:30:11,149 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-17 13:30:11,162 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-17 13:30:11,162 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-17 13:30:11,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:11,275 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-03-17 13:30:11,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2025-03-17 13:30:11,286 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:30:11,286 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-17 13:30:11,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:11,934 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-17 13:30:11,941 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:30:11,941 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-17 13:30:12,019 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-17 13:30:12,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:12,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:30:12,748 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-17 13:30:12,947 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-17 13:30:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37923909] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:12,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:12,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2025-03-17 13:30:12,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350015545] [2025-03-17 13:30:12,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:12,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 13:30:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:12,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 13:30:12,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2025-03-17 13:30:12,948 INFO L87 Difference]: Start difference. First operand 188 states and 202 transitions. Second operand has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 23 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:13,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:13,814 INFO L93 Difference]: Finished difference Result 362 states and 381 transitions. [2025-03-17 13:30:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:30:13,814 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 23 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2025-03-17 13:30:13,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:13,816 INFO L225 Difference]: With dead ends: 362 [2025-03-17 13:30:13,816 INFO L226 Difference]: Without dead ends: 362 [2025-03-17 13:30:13,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2025-03-17 13:30:13,817 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 360 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:13,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 708 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 13:30:13,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-17 13:30:13,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 183. [2025-03-17 13:30:13,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 154 states have (on average 1.2662337662337662) internal successors, (195), 180 states have internal predecessors, (195), 1 states have call successors, (1), 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-17 13:30:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 197 transitions. [2025-03-17 13:30:13,823 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 197 transitions. Word has length 107 [2025-03-17 13:30:13,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:13,823 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 197 transitions. [2025-03-17 13:30:13,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 23 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 197 transitions. [2025-03-17 13:30:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 13:30:13,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:13,824 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] [2025-03-17 13:30:13,835 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-17 13:30:14,024 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-17 13:30:14,025 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-17 13:30:14,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:14,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1029718125, now seen corresponding path program 1 times [2025-03-17 13:30:14,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:14,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260634400] [2025-03-17 13:30:14,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:14,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:14,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 13:30:14,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 13:30:14,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:14,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:14,234 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-17 13:30:14,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:14,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260634400] [2025-03-17 13:30:14,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260634400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:14,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:14,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:30:14,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38505255] [2025-03-17 13:30:14,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:14,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:30:14,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:14,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:30:14,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:30:14,235 INFO L87 Difference]: Start difference. First operand 183 states and 197 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 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-17 13:30:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:14,270 INFO L93 Difference]: Finished difference Result 188 states and 203 transitions. [2025-03-17 13:30:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:30:14,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 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 109 [2025-03-17 13:30:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:14,271 INFO L225 Difference]: With dead ends: 188 [2025-03-17 13:30:14,271 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 13:30:14,271 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-17 13:30:14,272 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 4 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 426 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-17 13:30:14,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 426 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 13:30:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2025-03-17 13:30:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 157 states have (on average 1.2611464968152866) internal successors, (198), 183 states have internal predecessors, (198), 1 states have call successors, (1), 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-17 13:30:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 200 transitions. [2025-03-17 13:30:14,275 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 200 transitions. Word has length 109 [2025-03-17 13:30:14,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:14,275 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 200 transitions. [2025-03-17 13:30:14,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 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-17 13:30:14,275 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 200 transitions. [2025-03-17 13:30:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 13:30:14,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:14,276 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] [2025-03-17 13:30:14,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 13:30:14,276 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-17 13:30:14,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:14,276 INFO L85 PathProgramCache]: Analyzing trace with hash -503631126, now seen corresponding path program 1 times [2025-03-17 13:30:14,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:14,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999083743] [2025-03-17 13:30:14,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:14,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:14,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 13:30:14,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 13:30:14,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:14,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:15,540 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-17 13:30:15,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:15,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999083743] [2025-03-17 13:30:15,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999083743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:15,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370153881] [2025-03-17 13:30:15,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:15,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:15,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:15,543 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-17 13:30:15,547 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-17 13:30:15,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 13:30:15,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 13:30:15,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:15,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:15,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 13:30:15,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:15,926 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-17 13:30:15,930 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-17 13:30:15,987 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2025-03-17 13:30:15,987 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-17 13:30:15,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:15,993 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-17 13:30:16,479 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-17 13:30:16,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:16,848 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-17 13:30:16,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370153881] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:16,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:16,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2025-03-17 13:30:16,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458998193] [2025-03-17 13:30:16,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:16,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 13:30:16,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:16,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 13:30:16,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-17 13:30:16,850 INFO L87 Difference]: Start difference. First operand 186 states and 200 transitions. Second operand has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:17,182 INFO L93 Difference]: Finished difference Result 267 states and 284 transitions. [2025-03-17 13:30:17,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 13:30:17,182 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2025-03-17 13:30:17,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:17,183 INFO L225 Difference]: With dead ends: 267 [2025-03-17 13:30:17,183 INFO L226 Difference]: Without dead ends: 267 [2025-03-17 13:30:17,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 213 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-17 13:30:17,184 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 229 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:17,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1356 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:30:17,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-17 13:30:17,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 248. [2025-03-17 13:30:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 219 states have (on average 1.1963470319634704) internal successors, (262), 245 states have internal predecessors, (262), 1 states have call successors, (1), 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-17 13:30:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 264 transitions. [2025-03-17 13:30:17,194 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 264 transitions. Word has length 111 [2025-03-17 13:30:17,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:17,195 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 264 transitions. [2025-03-17 13:30:17,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 264 transitions. [2025-03-17 13:30:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 13:30:17,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:17,195 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:17,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 13:30:17,396 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-17 13:30:17,397 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:30:17,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:17,397 INFO L85 PathProgramCache]: Analyzing trace with hash -512723235, now seen corresponding path program 1 times [2025-03-17 13:30:17,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:17,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968833129] [2025-03-17 13:30:17,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:17,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:17,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 13:30:17,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 13:30:17,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:17,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:17,538 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-17 13:30:17,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:17,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968833129] [2025-03-17 13:30:17,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968833129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:17,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:17,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:30:17,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628180896] [2025-03-17 13:30:17,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:17,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:17,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:17,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:17,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:17,542 INFO L87 Difference]: Start difference. First operand 248 states and 264 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 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-17 13:30:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:17,551 INFO L93 Difference]: Finished difference Result 252 states and 269 transitions. [2025-03-17 13:30:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:17,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2025-03-17 13:30:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:17,552 INFO L225 Difference]: With dead ends: 252 [2025-03-17 13:30:17,552 INFO L226 Difference]: Without dead ends: 252 [2025-03-17 13:30:17,552 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-17 13:30:17,552 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 3 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 227 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-17 13:30:17,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 227 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-17 13:30:17,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 249. [2025-03-17 13:30:17,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 220 states have (on average 1.1954545454545455) internal successors, (263), 246 states have internal predecessors, (263), 1 states have call successors, (1), 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-17 13:30:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 265 transitions. [2025-03-17 13:30:17,557 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 265 transitions. Word has length 114 [2025-03-17 13:30:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:17,557 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 265 transitions. [2025-03-17 13:30:17,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 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-17 13:30:17,557 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 265 transitions. [2025-03-17 13:30:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 13:30:17,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:17,557 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:17,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 13:30:17,557 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-17 13:30:17,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:17,558 INFO L85 PathProgramCache]: Analyzing trace with hash -512723075, now seen corresponding path program 1 times [2025-03-17 13:30:17,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:17,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119479050] [2025-03-17 13:30:17,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:17,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:17,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 13:30:17,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 13:30:17,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:17,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:18,280 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-17 13:30:18,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:18,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119479050] [2025-03-17 13:30:18,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119479050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:18,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116678061] [2025-03-17 13:30:18,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:18,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:18,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:18,283 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-17 13:30:18,285 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-17 13:30:18,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 13:30:18,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 13:30:18,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:18,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:18,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 1667 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 13:30:18,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:18,687 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 13:30:18,687 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-17 13:30:18,768 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 13:30:18,768 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-17 13:30:18,783 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2025-03-17 13:30:18,784 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-17 13:30:18,804 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 13:30:18,805 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-17 13:30:18,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 13:30:19,354 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-17 13:30:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-17 13:30:19,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-17 13:30:19,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116678061] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:19,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:19,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 24 [2025-03-17 13:30:19,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719109846] [2025-03-17 13:30:19,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:19,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 13:30:19,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:19,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 13:30:19,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-03-17 13:30:19,984 INFO L87 Difference]: Start difference. First operand 249 states and 265 transitions. Second operand has 25 states, 24 states have (on average 4.666666666666667) internal successors, (112), 25 states have internal predecessors, (112), 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-17 13:30:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:20,035 INFO L93 Difference]: Finished difference Result 247 states and 263 transitions. [2025-03-17 13:30:20,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:30:20,035 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.666666666666667) internal successors, (112), 25 states have internal predecessors, (112), 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 114 [2025-03-17 13:30:20,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:20,036 INFO L225 Difference]: With dead ends: 247 [2025-03-17 13:30:20,036 INFO L226 Difference]: Without dead ends: 247 [2025-03-17 13:30:20,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 213 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-03-17 13:30:20,037 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 362 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:20,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 75 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-17 13:30:20,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-03-17 13:30:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 220 states have (on average 1.1863636363636363) internal successors, (261), 244 states have internal predecessors, (261), 1 states have call successors, (1), 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-17 13:30:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 263 transitions. [2025-03-17 13:30:20,042 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 263 transitions. Word has length 114 [2025-03-17 13:30:20,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:20,042 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 263 transitions. [2025-03-17 13:30:20,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.666666666666667) internal successors, (112), 25 states have internal predecessors, (112), 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-17 13:30:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 263 transitions. [2025-03-17 13:30:20,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 13:30:20,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:20,043 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:20,053 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-17 13:30:20,244 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,SelfDestructingSolverStorable27 [2025-03-17 13:30:20,244 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:30:20,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:20,245 INFO L85 PathProgramCache]: Analyzing trace with hash -512723074, now seen corresponding path program 1 times [2025-03-17 13:30:20,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:20,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301305434] [2025-03-17 13:30:20,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:20,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:20,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 13:30:20,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 13:30:20,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:20,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:21,523 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-17 13:30:21,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:21,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301305434] [2025-03-17 13:30:21,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301305434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:21,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753035035] [2025-03-17 13:30:21,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:21,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:21,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:21,525 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-17 13:30:21,526 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-17 13:30:21,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 13:30:21,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 13:30:21,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:21,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:21,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 1667 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 13:30:21,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:21,901 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 13:30:21,901 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-17 13:30:21,904 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-17 13:30:22,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:22,105 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-17 13:30:22,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:22,113 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-03-17 13:30:22,113 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 1 [2025-03-17 13:30:22,168 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 13:30:22,168 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-17 13:30:22,632 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-17 13:30:22,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:23,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753035035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:23,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:30:23,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 21 [2025-03-17 13:30:23,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802460088] [2025-03-17 13:30:23,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:23,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 13:30:23,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:23,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 13:30:23,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2025-03-17 13:30:23,135 INFO L87 Difference]: Start difference. First operand 247 states and 263 transitions. Second operand has 22 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 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-17 13:30:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:23,623 INFO L93 Difference]: Finished difference Result 307 states and 324 transitions. [2025-03-17 13:30:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:30:23,624 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 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 114 [2025-03-17 13:30:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:23,625 INFO L225 Difference]: With dead ends: 307 [2025-03-17 13:30:23,625 INFO L226 Difference]: Without dead ends: 307 [2025-03-17 13:30:23,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=454, Invalid=1268, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 13:30:23,626 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 395 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:23,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 462 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:30:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-17 13:30:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 247. [2025-03-17 13:30:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 221 states have (on average 1.1809954751131222) internal successors, (261), 244 states have internal predecessors, (261), 1 states have call successors, (1), 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-17 13:30:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 263 transitions. [2025-03-17 13:30:23,630 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 263 transitions. Word has length 114 [2025-03-17 13:30:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:23,630 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 263 transitions. [2025-03-17 13:30:23,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 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-17 13:30:23,630 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 263 transitions. [2025-03-17 13:30:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 13:30:23,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:23,631 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:23,641 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-17 13:30:23,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 13:30:23,832 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-17 13:30:23,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1629409714, now seen corresponding path program 1 times [2025-03-17 13:30:23,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:23,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778965313] [2025-03-17 13:30:23,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:23,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:23,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 13:30:23,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 13:30:23,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:23,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:24,894 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-17 13:30:24,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778965313] [2025-03-17 13:30:24,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778965313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399794838] [2025-03-17 13:30:24,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:24,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:24,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:24,896 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-17 13:30:24,897 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-17 13:30:25,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 13:30:25,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 13:30:25,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:25,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:25,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 1688 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 13:30:25,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:25,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:25,288 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-17 13:30:25,297 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 13:30:25,298 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-17 13:30:25,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:25,544 INFO L349 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2025-03-17 13:30:25,545 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 29 treesize of output 23 [2025-03-17 13:30:25,551 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-17 13:30:25,567 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 13:30:25,567 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-17 13:30:25,574 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-17 13:30:25,649 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:30:25,649 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-17 13:30:25,656 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-17 13:30:25,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-17 13:30:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-17 13:30:26,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:26,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399794838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:26,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:30:26,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 25 [2025-03-17 13:30:26,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454461907] [2025-03-17 13:30:26,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:26,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 13:30:26,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:26,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 13:30:26,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=906, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 13:30:26,911 INFO L87 Difference]: Start difference. First operand 247 states and 263 transitions. Second operand has 26 states, 25 states have (on average 3.6) internal successors, (90), 25 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-17 13:30:27,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:27,465 INFO L93 Difference]: Finished difference Result 310 states and 327 transitions. [2025-03-17 13:30:27,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:30:27,466 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.6) internal successors, (90), 25 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 117 [2025-03-17 13:30:27,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:27,467 INFO L225 Difference]: With dead ends: 310 [2025-03-17 13:30:27,467 INFO L226 Difference]: Without dead ends: 310 [2025-03-17 13:30:27,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=469, Invalid=1601, Unknown=0, NotChecked=0, Total=2070 [2025-03-17 13:30:27,468 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 560 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:27,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 624 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:30:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-17 13:30:27,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 250. [2025-03-17 13:30:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 224 states have (on average 1.1785714285714286) internal successors, (264), 247 states have internal predecessors, (264), 1 states have call successors, (1), 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-17 13:30:27,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 266 transitions. [2025-03-17 13:30:27,471 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 266 transitions. Word has length 117 [2025-03-17 13:30:27,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:27,472 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 266 transitions. [2025-03-17 13:30:27,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.6) internal successors, (90), 25 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-17 13:30:27,472 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 266 transitions. [2025-03-17 13:30:27,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 13:30:27,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:27,472 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 3, 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, 1] [2025-03-17 13:30:27,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 13:30:27,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:27,673 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-17 13:30:27,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:27,674 INFO L85 PathProgramCache]: Analyzing trace with hash -24427138, now seen corresponding path program 2 times [2025-03-17 13:30:27,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:27,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580238162] [2025-03-17 13:30:27,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:30:27,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:27,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-03-17 13:30:27,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 13:30:27,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 13:30:27,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-17 13:30:29,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:29,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580238162] [2025-03-17 13:30:29,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580238162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:29,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210592211] [2025-03-17 13:30:29,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:30:29,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:29,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:29,007 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-17 13:30:29,009 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-17 13:30:29,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-03-17 13:30:29,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 13:30:29,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 13:30:29,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:29,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 1709 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 13:30:29,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:29,402 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 13:30:29,403 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-17 13:30:29,406 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-17 13:30:29,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:29,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:29,562 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-17 13:30:29,592 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 13:30:29,592 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-17 13:30:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-17 13:30:29,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:30,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210592211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:30,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:30:30,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6] total 23 [2025-03-17 13:30:30,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306883975] [2025-03-17 13:30:30,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:30,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 13:30:30,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:30,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 13:30:30,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2025-03-17 13:30:30,176 INFO L87 Difference]: Start difference. First operand 250 states and 266 transitions. Second operand has 24 states, 22 states have (on average 4.181818181818182) internal successors, (92), 22 states have internal predecessors, (92), 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-17 13:30:30,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:30,953 INFO L93 Difference]: Finished difference Result 349 states and 367 transitions. [2025-03-17 13:30:30,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 13:30:30,953 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 4.181818181818182) internal successors, (92), 22 states have internal predecessors, (92), 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 120 [2025-03-17 13:30:30,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:30,954 INFO L225 Difference]: With dead ends: 349 [2025-03-17 13:30:30,955 INFO L226 Difference]: Without dead ends: 349 [2025-03-17 13:30:30,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=503, Invalid=1753, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 13:30:30,956 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 421 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:30,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 561 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:30:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-17 13:30:30,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 259. [2025-03-17 13:30:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 233 states have (on average 1.1716738197424892) internal successors, (273), 256 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-17 13:30:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 275 transitions. [2025-03-17 13:30:30,960 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 275 transitions. Word has length 120 [2025-03-17 13:30:30,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:30,960 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 275 transitions. [2025-03-17 13:30:30,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 4.181818181818182) internal successors, (92), 22 states have internal predecessors, (92), 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-17 13:30:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 275 transitions. [2025-03-17 13:30:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 13:30:30,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:30,961 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 13:30:30,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 13:30:31,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:31,165 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-17 13:30:31,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:31,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1437035954, now seen corresponding path program 3 times [2025-03-17 13:30:31,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:31,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310090218] [2025-03-17 13:30:31,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 13:30:31,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:31,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 129 statements into 12 equivalence classes. [2025-03-17 13:30:31,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 129 statements. [2025-03-17 13:30:31,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 13:30:31,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2025-03-17 13:30:31,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:31,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310090218] [2025-03-17 13:30:31,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310090218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:31,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506089393] [2025-03-17 13:30:31,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 13:30:31,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:31,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:31,693 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-17 13:30:31,695 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-17 13:30:31,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 129 statements into 12 equivalence classes. [2025-03-17 13:30:32,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 129 statements. [2025-03-17 13:30:32,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 13:30:32,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:32,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-17 13:30:32,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:32,075 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 13:30:32,075 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-17 13:30:32,081 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-17 13:30:32,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:32,248 INFO L349 Elim1Store]: treesize reduction 40, result has 25.9 percent of original size [2025-03-17 13:30:32,248 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-17 13:30:32,253 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-17 13:30:32,292 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-17 13:30:32,292 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-17 13:30:32,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 13:30:32,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 13:30:32,369 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 25 treesize of output 9 [2025-03-17 13:30:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2025-03-17 13:30:32,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:33,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506089393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:33,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:30:33,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 21 [2025-03-17 13:30:33,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200536496] [2025-03-17 13:30:33,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:33,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 13:30:33,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:33,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 13:30:33,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2025-03-17 13:30:33,035 INFO L87 Difference]: Start difference. First operand 259 states and 275 transitions. Second operand has 22 states, 20 states have (on average 4.5) 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-17 13:30:33,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:33,517 INFO L93 Difference]: Finished difference Result 258 states and 274 transitions. [2025-03-17 13:30:33,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:30:33,517 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 4.5) 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 129 [2025-03-17 13:30:33,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:33,518 INFO L225 Difference]: With dead ends: 258 [2025-03-17 13:30:33,518 INFO L226 Difference]: Without dead ends: 258 [2025-03-17 13:30:33,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=319, Invalid=1163, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 13:30:33,519 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 503 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:33,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 554 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:30:33,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-17 13:30:33,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2025-03-17 13:30:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 232 states have (on average 1.168103448275862) internal successors, (271), 254 states have internal predecessors, (271), 1 states have call successors, (1), 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-17 13:30:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 273 transitions. [2025-03-17 13:30:33,523 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 273 transitions. Word has length 129 [2025-03-17 13:30:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:33,525 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 273 transitions. [2025-03-17 13:30:33,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 4.5) 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-17 13:30:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 273 transitions. [2025-03-17 13:30:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 13:30:33,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:33,526 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 13:30:33,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-17 13:30:33,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:33,727 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:30:33,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:33,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1987763051, now seen corresponding path program 1 times [2025-03-17 13:30:33,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:33,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629043667] [2025-03-17 13:30:33,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:33,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:33,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 13:30:33,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 13:30:33,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:33,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-17 13:30:33,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:33,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629043667] [2025-03-17 13:30:33,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629043667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:33,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762953410] [2025-03-17 13:30:33,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:33,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:33,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:33,918 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-17 13:30:33,919 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-17 13:30:34,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 13:30:34,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 13:30:34,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:34,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:34,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 1794 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 13:30:34,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-17 13:30:34,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:34,392 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-17 13:30:34,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762953410] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:34,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:34,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-17 13:30:34,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038381138] [2025-03-17 13:30:34,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:34,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 13:30:34,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:34,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 13:30:34,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-03-17 13:30:34,393 INFO L87 Difference]: Start difference. First operand 257 states and 273 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 1 states have call successors, (1), 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-17 13:30:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:34,429 INFO L93 Difference]: Finished difference Result 278 states and 294 transitions. [2025-03-17 13:30:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:30:34,429 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 1 states have call successors, (1), 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-17 13:30:34,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:34,430 INFO L225 Difference]: With dead ends: 278 [2025-03-17 13:30:34,430 INFO L226 Difference]: Without dead ends: 278 [2025-03-17 13:30:34,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-03-17 13:30:34,431 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 4 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:34,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 221 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-17 13:30:34,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-03-17 13:30:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 253 states have (on average 1.1541501976284585) internal successors, (292), 275 states have internal predecessors, (292), 1 states have call successors, (1), 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-17 13:30:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 294 transitions. [2025-03-17 13:30:34,434 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 294 transitions. Word has length 131 [2025-03-17 13:30:34,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:34,434 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 294 transitions. [2025-03-17 13:30:34,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 1 states have call successors, (1), 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-17 13:30:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 294 transitions. [2025-03-17 13:30:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 13:30:34,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:34,435 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 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-17 13:30:34,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-17 13:30:34,636 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,SelfDestructingSolverStorable32 [2025-03-17 13:30:34,636 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-17 13:30:34,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:34,637 INFO L85 PathProgramCache]: Analyzing trace with hash -260798309, now seen corresponding path program 2 times [2025-03-17 13:30:34,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:34,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710825281] [2025-03-17 13:30:34,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:30:34,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:34,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 152 statements into 2 equivalence classes. [2025-03-17 13:30:34,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 13:30:34,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 13:30:34,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-17 13:30:35,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:35,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710825281] [2025-03-17 13:30:35,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710825281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:35,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537832952] [2025-03-17 13:30:35,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:30:35,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:35,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:35,026 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-17 13:30:35,028 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-17 13:30:35,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 152 statements into 2 equivalence classes. [2025-03-17 13:30:35,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 13:30:35,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 13:30:35,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:35,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 1941 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 13:30:35,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-17 13:30:35,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-17 13:30:35,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537832952] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:35,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:35,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2025-03-17 13:30:35,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805777519] [2025-03-17 13:30:35,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:35,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 13:30:35,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:35,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 13:30:35,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2025-03-17 13:30:35,671 INFO L87 Difference]: Start difference. First operand 278 states and 294 transitions. Second operand has 29 states, 29 states have (on average 4.137931034482759) internal successors, (120), 29 states have internal predecessors, (120), 1 states have call successors, (1), 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-17 13:30:35,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:35,746 INFO L93 Difference]: Finished difference Result 320 states and 336 transitions. [2025-03-17 13:30:35,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 13:30:35,747 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.137931034482759) internal successors, (120), 29 states have internal predecessors, (120), 1 states have call successors, (1), 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 152 [2025-03-17 13:30:35,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:35,748 INFO L225 Difference]: With dead ends: 320 [2025-03-17 13:30:35,748 INFO L226 Difference]: Without dead ends: 320 [2025-03-17 13:30:35,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2025-03-17 13:30:35,748 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 4 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:35,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 548 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:30:35,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-17 13:30:35,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2025-03-17 13:30:35,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 295 states have (on average 1.1322033898305084) internal successors, (334), 317 states have internal predecessors, (334), 1 states have call successors, (1), 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-17 13:30:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 336 transitions. [2025-03-17 13:30:35,754 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 336 transitions. Word has length 152 [2025-03-17 13:30:35,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:35,754 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 336 transitions. [2025-03-17 13:30:35,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.137931034482759) internal successors, (120), 29 states have internal predecessors, (120), 1 states have call successors, (1), 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-17 13:30:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 336 transitions. [2025-03-17 13:30:35,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 13:30:35,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:35,756 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] [2025-03-17 13:30:35,767 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-17 13:30:35,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:35,958 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:30:35,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash 826867550, now seen corresponding path program 2 times [2025-03-17 13:30:35,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:35,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265342544] [2025-03-17 13:30:35,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:30:35,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:35,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 171 statements into 2 equivalence classes. [2025-03-17 13:30:36,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 13:30:36,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 13:30:36,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:37,004 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-17 13:30:37,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:37,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265342544] [2025-03-17 13:30:37,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265342544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:37,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301929802] [2025-03-17 13:30:37,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:30:37,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:37,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:37,007 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-17 13:30:37,009 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-17 13:30:37,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 171 statements into 2 equivalence classes. [2025-03-17 13:30:37,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 13:30:37,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 13:30:37,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:37,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 2007 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 13:30:37,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:37,666 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-17 13:30:37,679 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-17 13:30:37,817 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-17 13:30:37,819 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-17 13:30:37,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:37,889 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-17 13:30:37,890 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-17 13:30:37,952 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-17 13:30:37,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301929802] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:37,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:37,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2025-03-17 13:30:37,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961241855] [2025-03-17 13:30:37,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:37,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 13:30:37,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:37,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 13:30:37,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-17 13:30:37,954 INFO L87 Difference]: Start difference. First operand 320 states and 336 transitions. Second operand has 16 states, 15 states have (on average 7.266666666666667) internal successors, (109), 16 states have internal predecessors, (109), 1 states have call successors, (1), 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-17 13:30:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:38,191 INFO L93 Difference]: Finished difference Result 540 states and 572 transitions. [2025-03-17 13:30:38,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:30:38,191 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.266666666666667) internal successors, (109), 16 states have internal predecessors, (109), 1 states have call successors, (1), 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 171 [2025-03-17 13:30:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:38,192 INFO L225 Difference]: With dead ends: 540 [2025-03-17 13:30:38,192 INFO L226 Difference]: Without dead ends: 540 [2025-03-17 13:30:38,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-03-17 13:30:38,193 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 262 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:38,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 880 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:30:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-17 13:30:38,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 388. [2025-03-17 13:30:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 363 states have (on average 1.118457300275482) internal successors, (406), 385 states have internal predecessors, (406), 1 states have call successors, (1), 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-17 13:30:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 408 transitions. [2025-03-17 13:30:38,197 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 408 transitions. Word has length 171 [2025-03-17 13:30:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:38,198 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 408 transitions. [2025-03-17 13:30:38,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.266666666666667) internal successors, (109), 16 states have internal predecessors, (109), 1 states have call successors, (1), 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-17 13:30:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 408 transitions. [2025-03-17 13:30:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 13:30:38,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:38,199 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-17 13:30:38,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-17 13:30:38,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:38,399 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:30:38,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:38,400 INFO L85 PathProgramCache]: Analyzing trace with hash -136909636, now seen corresponding path program 1 times [2025-03-17 13:30:38,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:38,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966462538] [2025-03-17 13:30:38,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:38,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:38,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 13:30:38,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 13:30:38,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:38,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:39,662 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-17 13:30:39,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:39,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966462538] [2025-03-17 13:30:39,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966462538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:39,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303373911] [2025-03-17 13:30:39,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:39,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:39,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:39,664 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-17 13:30:39,666 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-17 13:30:39,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 13:30:40,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 13:30:40,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:40,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:40,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 2009 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 13:30:40,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:40,183 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-17 13:30:40,196 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-17 13:30:40,197 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-17 13:30:40,341 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-17 13:30:40,352 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-17 13:30:40,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:40,546 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-17 13:30:40,547 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-17 13:30:40,548 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-17 13:30:40,554 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-17 13:30:40,606 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-17 13:30:40,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303373911] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:40,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:40,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2025-03-17 13:30:40,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983869532] [2025-03-17 13:30:40,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:40,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 13:30:40,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:40,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 13:30:40,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-17 13:30:40,608 INFO L87 Difference]: Start difference. First operand 388 states and 408 transitions. Second operand has 21 states, 20 states have (on average 6.05) internal successors, (121), 21 states have internal predecessors, (121), 1 states have call successors, (1), 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-17 13:30:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:40,879 INFO L93 Difference]: Finished difference Result 539 states and 571 transitions. [2025-03-17 13:30:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 13:30:40,879 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.05) internal successors, (121), 21 states have internal predecessors, (121), 1 states have call successors, (1), 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-17 13:30:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:40,881 INFO L225 Difference]: With dead ends: 539 [2025-03-17 13:30:40,881 INFO L226 Difference]: Without dead ends: 539 [2025-03-17 13:30:40,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 334 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-17 13:30:40,881 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 254 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:40,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 890 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:30:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-17 13:30:40,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 389. [2025-03-17 13:30:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 364 states have (on average 1.1181318681318682) internal successors, (407), 386 states have internal predecessors, (407), 1 states have call successors, (1), 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-17 13:30:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 409 transitions. [2025-03-17 13:30:40,886 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 409 transitions. Word has length 172 [2025-03-17 13:30:40,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:40,886 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 409 transitions. [2025-03-17 13:30:40,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.05) internal successors, (121), 21 states have internal predecessors, (121), 1 states have call successors, (1), 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-17 13:30:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 409 transitions. [2025-03-17 13:30:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 13:30:40,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:40,887 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-17 13:30:40,898 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-17 13:30:41,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:41,088 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-17 13:30:41,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:41,089 INFO L85 PathProgramCache]: Analyzing trace with hash -136950319, now seen corresponding path program 1 times [2025-03-17 13:30:41,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:41,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508797811] [2025-03-17 13:30:41,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:41,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:41,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 13:30:41,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 13:30:41,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:41,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:41,315 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-17 13:30:41,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:41,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508797811] [2025-03-17 13:30:41,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508797811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:41,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:41,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:30:41,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499389591] [2025-03-17 13:30:41,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:41,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:41,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:41,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:41,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:41,316 INFO L87 Difference]: Start difference. First operand 389 states and 409 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (1), 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-17 13:30:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:41,321 INFO L93 Difference]: Finished difference Result 352 states and 364 transitions. [2025-03-17 13:30:41,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:41,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (1), 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-17 13:30:41,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:41,322 INFO L225 Difference]: With dead ends: 352 [2025-03-17 13:30:41,322 INFO L226 Difference]: Without dead ends: 352 [2025-03-17 13:30:41,323 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-17 13:30:41,323 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 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-17 13:30:41,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-17 13:30:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-03-17 13:30:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 343 states have (on average 1.055393586005831) internal successors, (362), 349 states have internal predecessors, (362), 1 states have call successors, (1), 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-17 13:30:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 364 transitions. [2025-03-17 13:30:41,327 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 364 transitions. Word has length 172 [2025-03-17 13:30:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:41,327 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 364 transitions. [2025-03-17 13:30:41,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (1), 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-17 13:30:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 364 transitions. [2025-03-17 13:30:41,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 13:30:41,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:41,328 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-17 13:30:41,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 13:30:41,328 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:30:41,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:41,328 INFO L85 PathProgramCache]: Analyzing trace with hash 50768668, now seen corresponding path program 1 times [2025-03-17 13:30:41,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:41,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172483703] [2025-03-17 13:30:41,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:41,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:41,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 13:30:41,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 13:30:41,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:41,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:42,241 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-17 13:30:42,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:42,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172483703] [2025-03-17 13:30:42,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172483703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:42,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314016899] [2025-03-17 13:30:42,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:42,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:42,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:42,244 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-17 13:30:42,244 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-17 13:30:42,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 13:30:42,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 13:30:42,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:42,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:42,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 2011 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 13:30:42,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:42,747 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 13:30:42,747 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-17 13:30:42,782 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2025-03-17 13:30:42,782 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-17 13:30:42,793 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 13:30:42,793 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-17 13:30:42,807 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 13:30:42,807 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-17 13:30:42,814 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-17 13:30:43,052 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-17 13:30:43,295 INFO L349 Elim1Store]: treesize reduction 50, result has 71.6 percent of original size [2025-03-17 13:30:43,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 44 treesize of output 156 [2025-03-17 13:30:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 501 proven. 14 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2025-03-17 13:30:51,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 94 proven. 545 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-03-17 13:30:51,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314016899] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:51,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:51,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 10] total 21 [2025-03-17 13:30:51,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465640949] [2025-03-17 13:30:51,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:51,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 13:30:51,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:51,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 13:30:51,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-03-17 13:30:51,970 INFO L87 Difference]: Start difference. First operand 352 states and 364 transitions. Second operand has 22 states, 21 states have (on average 6.476190476190476) internal successors, (136), 22 states have internal predecessors, (136), 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-17 13:30:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:51,995 INFO L93 Difference]: Finished difference Result 351 states and 363 transitions. [2025-03-17 13:30:51,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:30:51,995 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.476190476190476) internal successors, (136), 22 states have internal predecessors, (136), 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 173 [2025-03-17 13:30:51,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:51,996 INFO L225 Difference]: With dead ends: 351 [2025-03-17 13:30:51,996 INFO L226 Difference]: Without dead ends: 351 [2025-03-17 13:30:51,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 333 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-03-17 13:30:51,997 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 104 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:51,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 49 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-17 13:30:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-17 13:30:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 343 states have (on average 1.0524781341107872) internal successors, (361), 348 states have internal predecessors, (361), 1 states have call successors, (1), 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-17 13:30:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 363 transitions. [2025-03-17 13:30:52,000 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 363 transitions. Word has length 173 [2025-03-17 13:30:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:52,000 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 363 transitions. [2025-03-17 13:30:52,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.476190476190476) internal successors, (136), 22 states have internal predecessors, (136), 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-17 13:30:52,000 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 363 transitions. [2025-03-17 13:30:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-17 13:30:52,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:52,001 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-17 13:30:52,012 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-17 13:30:52,201 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,SelfDestructingSolverStorable37 [2025-03-17 13:30:52,201 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:30:52,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:52,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1573828794, now seen corresponding path program 1 times [2025-03-17 13:30:52,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:52,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305783201] [2025-03-17 13:30:52,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:52,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:52,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 13:30:52,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 13:30:52,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:52,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:53,611 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-17 13:30:53,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:53,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305783201] [2025-03-17 13:30:53,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305783201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:53,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609450162] [2025-03-17 13:30:53,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:53,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:53,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:53,613 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-17 13:30:53,614 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-17 13:30:53,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 13:30:54,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 13:30:54,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:54,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:54,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 2013 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-17 13:30:54,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:54,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:54,123 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-17 13:30:54,131 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 13:30:54,131 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-17 13:30:54,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:54,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:54,240 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-17 13:30:54,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:54,254 INFO L349 Elim1Store]: treesize reduction 40, result has 25.9 percent of original size [2025-03-17 13:30:54,254 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-17 13:30:54,313 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-17 13:30:54,313 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-17 13:30:54,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 13:30:54,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 13:30:54,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2025-03-17 13:30:54,833 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 13:30:54,834 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-17 13:30:54,866 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-17 13:30:55,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:30:55,496 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 1 case distinctions, treesize of input 37 treesize of output 17 [2025-03-17 13:30:55,512 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 5 treesize of output 3 [2025-03-17 13:30:55,534 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-17 13:30:55,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:55,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:30:55,827 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 66 treesize of output 70 [2025-03-17 13:30:56,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609450162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:56,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:30:56,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 27 [2025-03-17 13:30:56,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368928920] [2025-03-17 13:30:56,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:56,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 13:30:56,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:56,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 13:30:56,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=1236, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 13:30:56,358 INFO L87 Difference]: Start difference. First operand 351 states and 363 transitions. Second operand has 28 states, 27 states have (on average 4.074074074074074) internal successors, (110), 27 states have internal predecessors, (110), 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-17 13:30:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:57,142 INFO L93 Difference]: Finished difference Result 366 states and 382 transitions. [2025-03-17 13:30:57,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 13:30:57,143 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.074074074074074) internal successors, (110), 27 states have internal predecessors, (110), 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 174 [2025-03-17 13:30:57,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:57,144 INFO L225 Difference]: With dead ends: 366 [2025-03-17 13:30:57,144 INFO L226 Difference]: Without dead ends: 366 [2025-03-17 13:30:57,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=964, Invalid=2696, Unknown=0, NotChecked=0, Total=3660 [2025-03-17 13:30:57,145 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 528 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:57,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 648 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:30:57,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-17 13:30:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 350. [2025-03-17 13:30:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 343 states have (on average 1.0495626822157433) internal successors, (360), 347 states have internal predecessors, (360), 1 states have call successors, (1), 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-17 13:30:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 362 transitions. [2025-03-17 13:30:57,149 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 362 transitions. Word has length 174 [2025-03-17 13:30:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:57,149 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 362 transitions. [2025-03-17 13:30:57,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.074074074074074) internal successors, (110), 27 states have internal predecessors, (110), 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-17 13:30:57,150 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 362 transitions. [2025-03-17 13:30:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-17 13:30:57,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:57,150 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] [2025-03-17 13:30:57,161 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-17 13:30:57,351 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,SelfDestructingSolverStorable38 [2025-03-17 13:30:57,351 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:30:57,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:57,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1313811755, now seen corresponding path program 1 times [2025-03-17 13:30:57,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:57,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100587246] [2025-03-17 13:30:57,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:57,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 13:30:57,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 13:30:57,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:57,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:58,300 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-17 13:30:58,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:58,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100587246] [2025-03-17 13:30:58,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100587246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:58,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862440009] [2025-03-17 13:30:58,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:58,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:58,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:58,302 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-17 13:30:58,303 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-17 13:30:58,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 13:30:58,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 13:30:58,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:58,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:58,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 2028 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 13:30:58,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:58,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:58,840 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-17 13:30:58,846 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:30:58,846 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-17 13:30:59,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:59,049 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-17 13:30:59,052 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:30:59,052 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-17 13:30:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 1 proven. 531 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-17 13:30:59,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:59,717 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 13:30:59,718 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-17 13:30:59,792 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-17 13:30:59,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862440009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:59,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:59,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2025-03-17 13:30:59,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984901035] [2025-03-17 13:30:59,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:59,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 13:30:59,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:59,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 13:30:59,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2025-03-17 13:30:59,793 INFO L87 Difference]: Start difference. First operand 350 states and 362 transitions. Second operand has 28 states, 27 states have (on average 5.888888888888889) internal successors, (159), 28 states have internal predecessors, (159), 1 states have call successors, (1), 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-17 13:31:00,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:00,150 INFO L93 Difference]: Finished difference Result 446 states and 462 transitions. [2025-03-17 13:31:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:31:00,151 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 5.888888888888889) internal successors, (159), 28 states have internal predecessors, (159), 1 states have call successors, (1), 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 179 [2025-03-17 13:31:00,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:00,152 INFO L225 Difference]: With dead ends: 446 [2025-03-17 13:31:00,152 INFO L226 Difference]: Without dead ends: 446 [2025-03-17 13:31:00,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1149, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 13:31:00,152 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 421 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:00,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 629 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:31:00,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-17 13:31:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 351. [2025-03-17 13:31:00,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 345 states have (on average 1.0492753623188407) internal successors, (362), 348 states have internal predecessors, (362), 1 states have call successors, (1), 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-17 13:31:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 364 transitions. [2025-03-17 13:31:00,156 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 364 transitions. Word has length 179 [2025-03-17 13:31:00,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:00,156 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 364 transitions. [2025-03-17 13:31:00,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 5.888888888888889) internal successors, (159), 28 states have internal predecessors, (159), 1 states have call successors, (1), 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-17 13:31:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 364 transitions. [2025-03-17 13:31:00,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 13:31:00,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:00,157 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] [2025-03-17 13:31:00,169 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-17 13:31:00,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-17 13:31:00,358 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:31:00,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:00,358 INFO L85 PathProgramCache]: Analyzing trace with hash -147288408, now seen corresponding path program 1 times [2025-03-17 13:31:00,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:00,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955638531] [2025-03-17 13:31:00,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:00,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:00,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 13:31:00,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 13:31:00,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:00,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:02,002 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-17 13:31:02,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:02,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955638531] [2025-03-17 13:31:02,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955638531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:31:02,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719740090] [2025-03-17 13:31:02,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:02,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:02,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:31:02,005 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-17 13:31:02,006 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-17 13:31:02,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 13:31:02,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 13:31:02,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:02,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:02,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 2037 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 13:31:02,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:31:02,564 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-17 13:31:02,567 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-17 13:31:02,606 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-17 13:31:02,606 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-17 13:31:02,617 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-17 13:31:02,617 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-17 13:31:03,004 INFO L349 Elim1Store]: treesize reduction 27, result has 28.9 percent of original size [2025-03-17 13:31:03,004 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-17 13:31:03,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:31:03,009 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-17 13:31:03,312 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-17 13:31:03,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:31:03,991 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-17 13:31:03,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719740090] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:31:03,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:31:03,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 26 [2025-03-17 13:31:03,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492259489] [2025-03-17 13:31:03,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:31:03,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 13:31:03,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:03,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 13:31:03,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2025-03-17 13:31:03,992 INFO L87 Difference]: Start difference. First operand 351 states and 364 transitions. Second operand has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 1 states have call successors, (1), 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-17 13:31:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:04,456 INFO L93 Difference]: Finished difference Result 548 states and 566 transitions. [2025-03-17 13:31:04,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:31:04,457 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 1 states have call successors, (1), 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 181 [2025-03-17 13:31:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:04,458 INFO L225 Difference]: With dead ends: 548 [2025-03-17 13:31:04,458 INFO L226 Difference]: Without dead ends: 548 [2025-03-17 13:31:04,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=1025, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 13:31:04,459 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 404 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:04,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 989 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:31:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-17 13:31:04,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 356. [2025-03-17 13:31:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 350 states have (on average 1.0514285714285714) internal successors, (368), 353 states have internal predecessors, (368), 1 states have call successors, (1), 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-17 13:31:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 370 transitions. [2025-03-17 13:31:04,463 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 370 transitions. Word has length 181 [2025-03-17 13:31:04,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:04,463 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 370 transitions. [2025-03-17 13:31:04,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 1 states have call successors, (1), 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-17 13:31:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 370 transitions. [2025-03-17 13:31:04,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 13:31:04,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:04,464 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 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-17 13:31:04,476 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-17 13:31:04,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:04,665 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-17 13:31:04,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:04,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1528965787, now seen corresponding path program 3 times [2025-03-17 13:31:04,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:04,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083502882] [2025-03-17 13:31:04,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 13:31:04,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:04,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 194 statements into 27 equivalence classes. [2025-03-17 13:31:06,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 13:31:06,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2025-03-17 13:31:06,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-17 13:31:07,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:07,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083502882] [2025-03-17 13:31:07,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083502882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:31:07,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156531640] [2025-03-17 13:31:07,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 13:31:07,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:07,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:31:07,093 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-17 13:31:07,094 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-17 13:31:07,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 194 statements into 27 equivalence classes.