./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 13:29:41,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:29:41,642 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:41,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:29:41,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:29:41,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:29:41,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:29:41,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:29:41,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:29:41,667 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:29:41,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:29:41,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:29:41,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:29:41,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:29:41,669 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:29:41,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:29:41,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:29:41,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:29:41,669 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:29:41,669 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:29:41,669 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:29:41,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:29:41,669 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:29:41,670 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:29:41,670 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:29:41,670 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:29:41,670 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:29:41,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:29:41,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:29:41,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:29:41,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:29:41,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:29:41,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:29:41,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 13:29:41,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 13:29:41,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:29:41,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:29:41,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:29:41,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:29:41,671 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 [2025-03-17 13:29:41,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:29:41,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:29:41,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:29:41,892 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:29:41,892 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:29:41,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-03-17 13:29:43,018 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f5f2958f/3b58c6ebab5d461f907518492331bf1d/FLAG73736ca9d [2025-03-17 13:29:43,367 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:29:43,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-03-17 13:29:43,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f5f2958f/3b58c6ebab5d461f907518492331bf1d/FLAG73736ca9d [2025-03-17 13:29:43,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f5f2958f/3b58c6ebab5d461f907518492331bf1d [2025-03-17 13:29:43,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:29:43,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:29:43,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:29:43,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:29:43,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:29:43,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:29:43" (1/1) ... [2025-03-17 13:29:43,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b505bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:43, skipping insertion in model container [2025-03-17 13:29:43,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:29:43" (1/1) ... [2025-03-17 13:29:43,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:29:43,762 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:43,772 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:43,774 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:43,777 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:43,779 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:43,785 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:43,786 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:43,786 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:43,787 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:43,791 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:43,798 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:43,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:29:43,823 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:29:43,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:29:43,958 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:29:43,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:43 WrapperNode [2025-03-17 13:29:43,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:29:43,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:29:43,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:29:43,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:29:43,965 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:43" (1/1) ... [2025-03-17 13:29:43,991 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:43" (1/1) ... [2025-03-17 13:29:44,023 INFO L138 Inliner]: procedures = 346, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 729 [2025-03-17 13:29:44,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:29:44,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:29:44,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:29:44,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:29:44,031 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:43" (1/1) ... [2025-03-17 13:29:44,031 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:43" (1/1) ... [2025-03-17 13:29:44,036 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:43" (1/1) ... [2025-03-17 13:29:44,072 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 2, 3, 12, 355, 2, 12]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 0, 1, 0, 355, 0, 0]. The 11 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 0, 2, 5]. [2025-03-17 13:29:44,072 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:43" (1/1) ... [2025-03-17 13:29:44,072 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:43" (1/1) ... [2025-03-17 13:29:44,102 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:43" (1/1) ... [2025-03-17 13:29:44,104 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:43" (1/1) ... [2025-03-17 13:29:44,112 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:43" (1/1) ... [2025-03-17 13:29:44,117 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:43" (1/1) ... [2025-03-17 13:29:44,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:29:44,132 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:29:44,132 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:29:44,132 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:29:44,132 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:43" (1/1) ... [2025-03-17 13:29:44,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:29:44,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:44,156 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:44,160 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:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 13:29:44,177 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 13:29:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 13:29:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 13:29:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 13:29:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 13:29:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 13:29:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 13:29:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 13:29:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-17 13:29:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-17 13:29:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-17 13:29:44,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 13:29:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 13:29:44,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 13:29:44,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 13:29:44,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 13:29:44,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 13:29:44,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 13:29:44,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-17 13:29:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:29:44,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:29:44,464 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:29:44,466 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:29:45,067 INFO L? ?]: Removed 254 outVars from TransFormulas that were not future-live. [2025-03-17 13:29:45,068 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:29:45,081 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:29:45,082 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 13:29:45,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:29:45 BoogieIcfgContainer [2025-03-17 13:29:45,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:29:45,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:29:45,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:29:45,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:29:45,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:29:43" (1/3) ... [2025-03-17 13:29:45,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ff37f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:29:45, skipping insertion in model container [2025-03-17 13:29:45,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:43" (2/3) ... [2025-03-17 13:29:45,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ff37f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:29:45, skipping insertion in model container [2025-03-17 13:29:45,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:29:45" (3/3) ... [2025-03-17 13:29:45,092 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-2.i [2025-03-17 13:29:45,101 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:29:45,103 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG basename-2.i that has 2 procedures, 239 locations, 1 initial locations, 7 loop locations, and 96 error locations. [2025-03-17 13:29:45,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:29:45,144 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;@552b84de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:29:45,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2025-03-17 13:29:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 139 states have (on average 1.9640287769784173) internal successors, (273), 235 states have internal predecessors, (273), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 13:29:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:29:45,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:45,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:29:45,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:45,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:45,156 INFO L85 PathProgramCache]: Analyzing trace with hash 10399, now seen corresponding path program 1 times [2025-03-17 13:29:45,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:45,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367516358] [2025-03-17 13:29:45,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:45,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:45,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:29:45,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:29:45,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:45,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:45,630 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:45,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:45,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367516358] [2025-03-17 13:29:45,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367516358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:45,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:45,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:29:45,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136042500] [2025-03-17 13:29:45,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:45,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:29:45,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:45,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:29:45,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:45,655 INFO L87 Difference]: Start difference. First operand has 239 states, 139 states have (on average 1.9640287769784173) internal successors, (273), 235 states have internal predecessors, (273), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.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:45,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:45,821 INFO L93 Difference]: Finished difference Result 248 states and 280 transitions. [2025-03-17 13:29:45,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:29:45,823 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:45,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:45,829 INFO L225 Difference]: With dead ends: 248 [2025-03-17 13:29:45,830 INFO L226 Difference]: Without dead ends: 246 [2025-03-17 13:29:45,831 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:45,833 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 233 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:45,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 196 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:45,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-17 13:29:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 230. [2025-03-17 13:29:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 135 states have (on average 1.9037037037037037) internal successors, (257), 226 states have internal predecessors, (257), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 13:29:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 261 transitions. [2025-03-17 13:29:45,872 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 261 transitions. Word has length 2 [2025-03-17 13:29:45,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:45,872 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 261 transitions. [2025-03-17 13:29:45,872 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:45,872 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 261 transitions. [2025-03-17 13:29:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:29:45,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:45,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:29:45,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 13:29:45,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:45,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash 10400, now seen corresponding path program 1 times [2025-03-17 13:29:45,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:45,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361120092] [2025-03-17 13:29:45,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:45,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:45,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:29:45,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:29:45,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:45,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:46,105 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:46,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:46,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361120092] [2025-03-17 13:29:46,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361120092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:46,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:46,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:29:46,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341500456] [2025-03-17 13:29:46,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:46,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:29:46,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:46,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:29:46,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:46,107 INFO L87 Difference]: Start difference. First operand 230 states and 261 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:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:46,238 INFO L93 Difference]: Finished difference Result 229 states and 260 transitions. [2025-03-17 13:29:46,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:29:46,238 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:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:46,239 INFO L225 Difference]: With dead ends: 229 [2025-03-17 13:29:46,239 INFO L226 Difference]: Without dead ends: 229 [2025-03-17 13:29:46,239 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:46,240 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 10 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:46,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 416 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-17 13:29:46,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-03-17 13:29:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 135 states have (on average 1.8962962962962964) internal successors, (256), 225 states have internal predecessors, (256), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 13:29:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 260 transitions. [2025-03-17 13:29:46,260 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 260 transitions. Word has length 2 [2025-03-17 13:29:46,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:46,260 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 260 transitions. [2025-03-17 13:29:46,260 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:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 260 transitions. [2025-03-17 13:29:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 13:29:46,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:46,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 13:29:46,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 13:29:46,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:46,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:46,261 INFO L85 PathProgramCache]: Analyzing trace with hash 310055748, now seen corresponding path program 1 times [2025-03-17 13:29:46,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:46,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948000748] [2025-03-17 13:29:46,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:46,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:46,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 13:29:46,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 13:29:46,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:46,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:46,514 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:46,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:46,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948000748] [2025-03-17 13:29:46,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948000748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:46,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:46,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:29:46,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650289619] [2025-03-17 13:29:46,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:46,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:29:46,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:46,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:29:46,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:29:46,516 INFO L87 Difference]: Start difference. First operand 229 states and 260 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:46,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:46,652 INFO L93 Difference]: Finished difference Result 232 states and 263 transitions. [2025-03-17 13:29:46,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:29:46,652 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:46,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:46,653 INFO L225 Difference]: With dead ends: 232 [2025-03-17 13:29:46,654 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 13:29:46,654 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:46,655 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 11 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:46,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 416 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:46,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 13:29:46,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2025-03-17 13:29:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 137 states have (on average 1.8832116788321167) internal successors, (258), 227 states have internal predecessors, (258), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 13:29:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 262 transitions. [2025-03-17 13:29:46,668 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 262 transitions. Word has length 5 [2025-03-17 13:29:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:46,669 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 262 transitions. [2025-03-17 13:29:46,669 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:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 262 transitions. [2025-03-17 13:29:46,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 13:29:46,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:46,670 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:46,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 13:29:46,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:46,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1603640485, now seen corresponding path program 1 times [2025-03-17 13:29:46,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:46,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451248011] [2025-03-17 13:29:46,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:46,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:46,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:29:46,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:29:46,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:46,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:46,924 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:46,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:46,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451248011] [2025-03-17 13:29:46,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451248011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:29:46,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759645928] [2025-03-17 13:29:46,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:46,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:46,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:46,927 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:46,929 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:47,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:29:47,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:29:47,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:47,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:47,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 13:29:47,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:29:47,232 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:47,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:29:47,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 7 treesize of output 5 [2025-03-17 13:29:47,329 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:47,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759645928] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:29:47,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:29:47,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-17 13:29:47,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406225514] [2025-03-17 13:29:47,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:29:47,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:29:47,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:47,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:29:47,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:29:47,331 INFO L87 Difference]: Start difference. First operand 231 states and 262 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:47,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:47,718 INFO L93 Difference]: Finished difference Result 235 states and 266 transitions. [2025-03-17 13:29:47,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:29:47,718 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:47,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:47,719 INFO L225 Difference]: With dead ends: 235 [2025-03-17 13:29:47,719 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 13:29:47,719 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:47,720 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 261 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:47,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 1089 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:29:47,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 13:29:47,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-03-17 13:29:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 142 states have (on average 1.8450704225352113) internal successors, (262), 231 states have internal predecessors, (262), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 13:29:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 266 transitions. [2025-03-17 13:29:47,725 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 266 transitions. Word has length 8 [2025-03-17 13:29:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:47,725 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 266 transitions. [2025-03-17 13:29:47,725 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:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 266 transitions. [2025-03-17 13:29:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 13:29:47,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:47,726 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2025-03-17 13:29:47,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 13:29:47,926 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:47,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:47,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:47,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1905907174, now seen corresponding path program 1 times [2025-03-17 13:29:47,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:47,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599610457] [2025-03-17 13:29:47,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:47,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:47,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 13:29:47,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 13:29:47,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:47,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 13:29:48,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:48,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599610457] [2025-03-17 13:29:48,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599610457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:48,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:48,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:29:48,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488564029] [2025-03-17 13:29:48,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:48,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:29:48,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:48,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:29:48,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:29:48,203 INFO L87 Difference]: Start difference. First operand 235 states and 266 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:48,329 INFO L93 Difference]: Finished difference Result 250 states and 282 transitions. [2025-03-17 13:29:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:29:48,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 13:29:48,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:48,330 INFO L225 Difference]: With dead ends: 250 [2025-03-17 13:29:48,330 INFO L226 Difference]: Without dead ends: 250 [2025-03-17 13:29:48,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:29:48,331 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 230 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:48,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 229 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:48,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-17 13:29:48,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 234. [2025-03-17 13:29:48,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 142 states have (on average 1.8380281690140845) internal successors, (261), 230 states have internal predecessors, (261), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 13:29:48,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 265 transitions. [2025-03-17 13:29:48,336 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 265 transitions. Word has length 14 [2025-03-17 13:29:48,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:48,336 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 265 transitions. [2025-03-17 13:29:48,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:48,336 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 265 transitions. [2025-03-17 13:29:48,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 13:29:48,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:48,337 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2025-03-17 13:29:48,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 13:29:48,337 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:48,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1905907173, now seen corresponding path program 1 times [2025-03-17 13:29:48,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:48,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794683632] [2025-03-17 13:29:48,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:48,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:48,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 13:29:48,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 13:29:48,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:48,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:48,487 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:48,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:48,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794683632] [2025-03-17 13:29:48,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794683632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:29:48,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941394364] [2025-03-17 13:29:48,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:48,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:48,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:48,489 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:48,490 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:48,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 13:29:48,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 13:29:48,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:48,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:48,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 13:29:48,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:29:48,725 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:48,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:29:48,769 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:48,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941394364] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:29:48,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:29:48,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-17 13:29:48,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308463663] [2025-03-17 13:29:48,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:29:48,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 13:29:48,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:48,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 13:29:48,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:29:48,770 INFO L87 Difference]: Start difference. First operand 234 states and 265 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:48,821 INFO L93 Difference]: Finished difference Result 249 states and 280 transitions. [2025-03-17 13:29:48,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 13:29:48,822 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 13:29:48,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:48,823 INFO L225 Difference]: With dead ends: 249 [2025-03-17 13:29:48,823 INFO L226 Difference]: Without dead ends: 249 [2025-03-17 13:29:48,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 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:48,823 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 4 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:48,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1011 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:29:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-17 13:29:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2025-03-17 13:29:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 157 states have (on average 1.7579617834394905) internal successors, (276), 245 states have internal predecessors, (276), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 13:29:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 280 transitions. [2025-03-17 13:29:48,829 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 280 transitions. Word has length 14 [2025-03-17 13:29:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:48,829 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 280 transitions. [2025-03-17 13:29:48,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:48,829 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 280 transitions. [2025-03-17 13:29:48,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 13:29:48,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:48,830 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1] [2025-03-17 13:29:48,838 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:49,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 13:29:49,034 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:49,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:49,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1761154340, now seen corresponding path program 2 times [2025-03-17 13:29:49,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:49,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037550648] [2025-03-17 13:29:49,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:29:49,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:49,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 13:29:49,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 29 statements. [2025-03-17 13:29:49,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 13:29:49,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:49,222 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:49,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:49,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037550648] [2025-03-17 13:29:49,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037550648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:49,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:49,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:29:49,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560109298] [2025-03-17 13:29:49,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:49,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:29:49,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:49,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:29:49,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:29:49,224 INFO L87 Difference]: Start difference. First operand 249 states and 280 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:49,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:49,304 INFO L93 Difference]: Finished difference Result 252 states and 282 transitions. [2025-03-17 13:29:49,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:29:49,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-17 13:29:49,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:49,306 INFO L225 Difference]: With dead ends: 252 [2025-03-17 13:29:49,306 INFO L226 Difference]: Without dead ends: 252 [2025-03-17 13:29:49,307 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:49,307 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 9 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:49,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 423 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:49,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-17 13:29:49,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-03-17 13:29:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 160 states have (on average 1.7375) internal successors, (278), 247 states have internal predecessors, (278), 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:29:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 282 transitions. [2025-03-17 13:29:49,314 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 282 transitions. Word has length 29 [2025-03-17 13:29:49,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:49,314 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 282 transitions. [2025-03-17 13:29:49,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 282 transitions. [2025-03-17 13:29:49,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 13:29:49,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:49,315 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:49,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 13:29:49,315 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:49,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:49,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2135296070, now seen corresponding path program 1 times [2025-03-17 13:29:49,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:49,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663635774] [2025-03-17 13:29:49,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:49,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:49,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 13:29:49,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 13:29:49,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:49,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:49,601 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:49,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:49,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663635774] [2025-03-17 13:29:49,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663635774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:29:49,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847308232] [2025-03-17 13:29:49,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:49,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:49,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:49,603 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:49,605 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:49,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 13:29:49,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 13:29:49,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:49,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:49,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 13:29:49,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:29:49,886 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:49,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:29:49,991 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:49,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847308232] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:29:49,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:29:49,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-03-17 13:29:49,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101929853] [2025-03-17 13:29:49,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:29:49,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 13:29:49,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:49,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 13:29:49,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:29:49,993 INFO L87 Difference]: Start difference. First operand 252 states and 282 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 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:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:50,059 INFO L93 Difference]: Finished difference Result 258 states and 288 transitions. [2025-03-17 13:29:50,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:29:50,060 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 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 37 [2025-03-17 13:29:50,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:50,061 INFO L225 Difference]: With dead ends: 258 [2025-03-17 13:29:50,061 INFO L226 Difference]: Without dead ends: 258 [2025-03-17 13:29:50,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 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:50,062 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 2 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:50,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1509 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:29:50,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-17 13:29:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-03-17 13:29:50,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 166 states have (on average 1.7108433734939759) internal successors, (284), 253 states have internal predecessors, (284), 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:29:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 288 transitions. [2025-03-17 13:29:50,065 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 288 transitions. Word has length 37 [2025-03-17 13:29:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:50,066 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 288 transitions. [2025-03-17 13:29:50,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 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:50,066 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 288 transitions. [2025-03-17 13:29:50,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 13:29:50,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:50,068 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:50,076 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:50,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:50,268 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:50,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:50,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1925704794, now seen corresponding path program 2 times [2025-03-17 13:29:50,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:50,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967456433] [2025-03-17 13:29:50,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:29:50,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:50,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-17 13:29:50,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 43 statements. [2025-03-17 13:29:50,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 13:29:50,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:50,419 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:50,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:50,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967456433] [2025-03-17 13:29:50,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967456433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:50,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:50,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:29:50,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36576182] [2025-03-17 13:29:50,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:50,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:29:50,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:50,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:29:50,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:50,420 INFO L87 Difference]: Start difference. First operand 258 states and 288 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states 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:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:50,522 INFO L93 Difference]: Finished difference Result 269 states and 300 transitions. [2025-03-17 13:29:50,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:29:50,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 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 43 [2025-03-17 13:29:50,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:50,524 INFO L225 Difference]: With dead ends: 269 [2025-03-17 13:29:50,524 INFO L226 Difference]: Without dead ends: 269 [2025-03-17 13:29:50,524 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:50,524 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 213 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:50,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 198 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-17 13:29:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 253. [2025-03-17 13:29:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 166 states have (on average 1.680722891566265) internal successors, (279), 248 states have internal predecessors, (279), 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:29:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 283 transitions. [2025-03-17 13:29:50,528 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 283 transitions. Word has length 43 [2025-03-17 13:29:50,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:50,528 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 283 transitions. [2025-03-17 13:29:50,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states 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:50,529 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 283 transitions. [2025-03-17 13:29:50,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 13:29:50,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:50,529 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:50,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 13:29:50,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:50,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:50,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1925704795, now seen corresponding path program 1 times [2025-03-17 13:29:50,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:50,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971670840] [2025-03-17 13:29:50,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:50,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:50,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 13:29:50,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 13:29:50,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:50,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:51,052 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:51,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:51,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971670840] [2025-03-17 13:29:51,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971670840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:51,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:51,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:29:51,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304442030] [2025-03-17 13:29:51,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:51,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:29:51,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:51,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:29:51,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:29:51,054 INFO L87 Difference]: Start difference. First operand 253 states and 283 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states 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:51,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:51,321 INFO L93 Difference]: Finished difference Result 410 states and 470 transitions. [2025-03-17 13:29:51,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 13:29:51,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 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 43 [2025-03-17 13:29:51,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:51,323 INFO L225 Difference]: With dead ends: 410 [2025-03-17 13:29:51,323 INFO L226 Difference]: Without dead ends: 410 [2025-03-17 13:29:51,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:29:51,323 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 399 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:51,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 764 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:29:51,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-17 13:29:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 252. [2025-03-17 13:29:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 166 states have (on average 1.6746987951807228) internal successors, (278), 247 states have internal predecessors, (278), 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:29:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 282 transitions. [2025-03-17 13:29:51,329 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 282 transitions. Word has length 43 [2025-03-17 13:29:51,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:51,329 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 282 transitions. [2025-03-17 13:29:51,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states 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:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 282 transitions. [2025-03-17 13:29:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 13:29:51,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:51,330 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:51,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 13:29:51,331 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:51,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:51,331 INFO L85 PathProgramCache]: Analyzing trace with hash 793588633, now seen corresponding path program 1 times [2025-03-17 13:29:51,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:51,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850201119] [2025-03-17 13:29:51,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:51,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:51,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 13:29:51,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 13:29:51,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:51,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:51,628 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:51,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:51,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850201119] [2025-03-17 13:29:51,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850201119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:51,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:51,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:29:51,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283030920] [2025-03-17 13:29:51,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:51,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:29:51,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:51,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:29:51,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:29:51,629 INFO L87 Difference]: Start difference. First operand 252 states and 282 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states 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:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:51,913 INFO L93 Difference]: Finished difference Result 280 states and 314 transitions. [2025-03-17 13:29:51,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:29:51,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 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 46 [2025-03-17 13:29:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:51,915 INFO L225 Difference]: With dead ends: 280 [2025-03-17 13:29:51,915 INFO L226 Difference]: Without dead ends: 280 [2025-03-17 13:29:51,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:29:51,915 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 281 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:51,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 386 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:29:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-17 13:29:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 265. [2025-03-17 13:29:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 180 states have (on average 1.6611111111111112) internal successors, (299), 260 states have internal predecessors, (299), 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:29:51,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 303 transitions. [2025-03-17 13:29:51,921 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 303 transitions. Word has length 46 [2025-03-17 13:29:51,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:51,921 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 303 transitions. [2025-03-17 13:29:51,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states 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:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 303 transitions. [2025-03-17 13:29:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 13:29:51,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:51,922 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:51,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 13:29:51,922 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:51,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:51,922 INFO L85 PathProgramCache]: Analyzing trace with hash 793587704, now seen corresponding path program 1 times [2025-03-17 13:29:51,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:51,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040095189] [2025-03-17 13:29:51,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:51,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:51,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 13:29:51,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 13:29:51,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:51,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:52,060 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:52,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:52,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040095189] [2025-03-17 13:29:52,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040095189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:52,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:52,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:29:52,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766566165] [2025-03-17 13:29:52,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:52,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:29:52,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:52,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:29:52,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:29:52,062 INFO L87 Difference]: Start difference. First operand 265 states and 303 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states 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:52,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:52,213 INFO L93 Difference]: Finished difference Result 294 states and 339 transitions. [2025-03-17 13:29:52,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:29:52,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 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 46 [2025-03-17 13:29:52,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:52,214 INFO L225 Difference]: With dead ends: 294 [2025-03-17 13:29:52,216 INFO L226 Difference]: Without dead ends: 294 [2025-03-17 13:29:52,216 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:52,216 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 377 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:52,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 249 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-17 13:29:52,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 258. [2025-03-17 13:29:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 180 states have (on average 1.6222222222222222) internal successors, (292), 253 states have internal predecessors, (292), 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:29:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 296 transitions. [2025-03-17 13:29:52,223 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 296 transitions. Word has length 46 [2025-03-17 13:29:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:52,223 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 296 transitions. [2025-03-17 13:29:52,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states 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:52,224 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 296 transitions. [2025-03-17 13:29:52,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 13:29:52,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:52,224 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:52,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 13:29:52,224 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:52,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:52,225 INFO L85 PathProgramCache]: Analyzing trace with hash 793587705, now seen corresponding path program 1 times [2025-03-17 13:29:52,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:52,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502774288] [2025-03-17 13:29:52,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:52,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:52,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 13:29:52,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 13:29:52,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:52,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:52,432 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:52,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:52,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502774288] [2025-03-17 13:29:52,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502774288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:52,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:52,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:29:52,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247259822] [2025-03-17 13:29:52,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:52,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:29:52,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:52,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:29:52,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:29:52,433 INFO L87 Difference]: Start difference. First operand 258 states and 296 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states 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:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:52,501 INFO L93 Difference]: Finished difference Result 263 states and 295 transitions. [2025-03-17 13:29:52,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:29:52,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 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 46 [2025-03-17 13:29:52,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:52,502 INFO L225 Difference]: With dead ends: 263 [2025-03-17 13:29:52,502 INFO L226 Difference]: Without dead ends: 263 [2025-03-17 13:29:52,503 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:52,503 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 245 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:52,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 894 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:52,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-17 13:29:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 258. [2025-03-17 13:29:52,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 180 states have (on average 1.6166666666666667) internal successors, (291), 253 states have internal predecessors, (291), 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:29:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 295 transitions. [2025-03-17 13:29:52,509 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 295 transitions. Word has length 46 [2025-03-17 13:29:52,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:52,509 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 295 transitions. [2025-03-17 13:29:52,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states 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:52,510 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 295 transitions. [2025-03-17 13:29:52,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 13:29:52,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:52,510 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] [2025-03-17 13:29:52,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 13:29:52,510 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:52,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:52,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1995790347, now seen corresponding path program 1 times [2025-03-17 13:29:52,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:52,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024006571] [2025-03-17 13:29:52,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:52,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:52,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 13:29:52,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 13:29:52,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:52,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:52,742 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:52,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:52,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024006571] [2025-03-17 13:29:52,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024006571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:52,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:52,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:29:52,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407504471] [2025-03-17 13:29:52,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:52,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:29:52,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:52,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:29:52,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:52,744 INFO L87 Difference]: Start difference. First operand 258 states and 295 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states 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:52,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:52,832 INFO L93 Difference]: Finished difference Result 263 states and 302 transitions. [2025-03-17 13:29:52,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:29:52,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 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 49 [2025-03-17 13:29:52,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:52,833 INFO L225 Difference]: With dead ends: 263 [2025-03-17 13:29:52,833 INFO L226 Difference]: Without dead ends: 263 [2025-03-17 13:29:52,834 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:52,834 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 199 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:52,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 194 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-17 13:29:52,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2025-03-17 13:29:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 185 states have (on average 1.6108108108108108) internal successors, (298), 257 states have internal predecessors, (298), 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:29:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 302 transitions. [2025-03-17 13:29:52,839 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 302 transitions. Word has length 49 [2025-03-17 13:29:52,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:52,839 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 302 transitions. [2025-03-17 13:29:52,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states 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:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 302 transitions. [2025-03-17 13:29:52,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 13:29:52,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:52,840 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] [2025-03-17 13:29:52,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 13:29:52,840 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:52,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1995790346, now seen corresponding path program 1 times [2025-03-17 13:29:52,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:52,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341155684] [2025-03-17 13:29:52,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:52,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 13:29:52,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 13:29:52,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:52,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:53,327 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:53,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:53,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341155684] [2025-03-17 13:29:53,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341155684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:53,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:53,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:29:53,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820455166] [2025-03-17 13:29:53,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:53,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:29:53,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:53,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:29:53,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:29:53,328 INFO L87 Difference]: Start difference. First operand 262 states and 302 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states 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,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:53,672 INFO L93 Difference]: Finished difference Result 272 states and 306 transitions. [2025-03-17 13:29:53,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 13:29:53,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 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 49 [2025-03-17 13:29:53,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:53,674 INFO L225 Difference]: With dead ends: 272 [2025-03-17 13:29:53,674 INFO L226 Difference]: Without dead ends: 272 [2025-03-17 13:29:53,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 13:29:53,675 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 230 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:53,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 496 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:29:53,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-17 13:29:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 262. [2025-03-17 13:29:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 185 states have (on average 1.6) internal successors, (296), 257 states have internal predecessors, (296), 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:29:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 300 transitions. [2025-03-17 13:29:53,682 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 300 transitions. Word has length 49 [2025-03-17 13:29:53,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:53,682 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 300 transitions. [2025-03-17 13:29:53,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states 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,682 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 300 transitions. [2025-03-17 13:29:53,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 13:29:53,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:53,684 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] [2025-03-17 13:29:53,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 13:29:53,684 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:53,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:53,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1357717679, now seen corresponding path program 1 times [2025-03-17 13:29:53,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:53,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017101932] [2025-03-17 13:29:53,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:53,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:53,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 13:29:53,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 13:29:53,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:53,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:53,927 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:53,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:53,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017101932] [2025-03-17 13:29:53,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017101932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:53,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:53,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:29:53,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145880352] [2025-03-17 13:29:53,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:53,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:29:53,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:53,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:29:53,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:29:53,929 INFO L87 Difference]: Start difference. First operand 262 states and 300 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states 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,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:54,092 INFO L93 Difference]: Finished difference Result 261 states and 298 transitions. [2025-03-17 13:29:54,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:29:54,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 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 52 [2025-03-17 13:29:54,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:54,093 INFO L225 Difference]: With dead ends: 261 [2025-03-17 13:29:54,093 INFO L226 Difference]: Without dead ends: 261 [2025-03-17 13:29:54,093 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:29:54,094 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 12 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:54,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 688 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:29:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-17 13:29:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-03-17 13:29:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 185 states have (on average 1.5891891891891892) internal successors, (294), 256 states have internal predecessors, (294), 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:29:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 298 transitions. [2025-03-17 13:29:54,098 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 298 transitions. Word has length 52 [2025-03-17 13:29:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:54,098 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 298 transitions. [2025-03-17 13:29:54,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states 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,098 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 298 transitions. [2025-03-17 13:29:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 13:29:54,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:54,099 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] [2025-03-17 13:29:54,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 13:29:54,099 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:54,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:54,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1357717678, now seen corresponding path program 1 times [2025-03-17 13:29:54,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:54,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580465193] [2025-03-17 13:29:54,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:54,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 13:29:54,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 13:29:54,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:54,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:54,459 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:54,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:54,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580465193] [2025-03-17 13:29:54,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580465193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:54,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:54,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:29:54,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960174494] [2025-03-17 13:29:54,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:54,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:29:54,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:54,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:29:54,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:29:54,461 INFO L87 Difference]: Start difference. First operand 261 states and 298 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states 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,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:54,643 INFO L93 Difference]: Finished difference Result 260 states and 296 transitions. [2025-03-17 13:29:54,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:29:54,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 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 52 [2025-03-17 13:29:54,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:54,644 INFO L225 Difference]: With dead ends: 260 [2025-03-17 13:29:54,644 INFO L226 Difference]: Without dead ends: 260 [2025-03-17 13:29:54,644 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:29:54,645 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 11 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:54,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 690 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:29:54,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-17 13:29:54,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2025-03-17 13:29:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 185 states have (on average 1.5783783783783785) internal successors, (292), 255 states have internal predecessors, (292), 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:29:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 296 transitions. [2025-03-17 13:29:54,649 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 296 transitions. Word has length 52 [2025-03-17 13:29:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:54,649 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 296 transitions. [2025-03-17 13:29:54,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states 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,649 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 296 transitions. [2025-03-17 13:29:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 13:29:54,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:54,649 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:54,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 13:29:54,650 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:54,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:54,650 INFO L85 PathProgramCache]: Analyzing trace with hash 560649221, now seen corresponding path program 1 times [2025-03-17 13:29:54,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:54,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072885085] [2025-03-17 13:29:54,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:54,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:54,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 13:29:54,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 13:29:54,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:54,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:54,767 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:29:54,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:54,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072885085] [2025-03-17 13:29:54,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072885085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:54,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:54,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:29:54,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719316039] [2025-03-17 13:29:54,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:54,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:29:54,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:54,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:29:54,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:54,768 INFO L87 Difference]: Start difference. First operand 260 states and 296 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:54,790 INFO L93 Difference]: Finished difference Result 272 states and 311 transitions. [2025-03-17 13:29:54,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:29:54,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-17 13:29:54,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:54,792 INFO L225 Difference]: With dead ends: 272 [2025-03-17 13:29:54,792 INFO L226 Difference]: Without dead ends: 272 [2025-03-17 13:29:54,792 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:54,792 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 6 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 469 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:29:54,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 469 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:29:54,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-17 13:29:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 262. [2025-03-17 13:29:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 187 states have (on average 1.572192513368984) internal successors, (294), 257 states have internal predecessors, (294), 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:29:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 298 transitions. [2025-03-17 13:29:54,797 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 298 transitions. Word has length 56 [2025-03-17 13:29:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:54,797 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 298 transitions. [2025-03-17 13:29:54,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 298 transitions. [2025-03-17 13:29:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 13:29:54,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:54,798 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] [2025-03-17 13:29:54,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 13:29:54,798 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:54,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash 200503211, now seen corresponding path program 1 times [2025-03-17 13:29:54,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:54,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197474387] [2025-03-17 13:29:54,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:54,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:54,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 13:29:54,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 13:29:54,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:54,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:54,955 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:54,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:54,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197474387] [2025-03-17 13:29:54,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197474387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:54,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:54,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:29:54,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549632184] [2025-03-17 13:29:54,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:54,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:29:54,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:54,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:29:54,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:29:54,957 INFO L87 Difference]: Start difference. First operand 262 states and 298 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:55,097 INFO L93 Difference]: Finished difference Result 261 states and 296 transitions. [2025-03-17 13:29:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:29:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-03-17 13:29:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:55,099 INFO L225 Difference]: With dead ends: 261 [2025-03-17 13:29:55,099 INFO L226 Difference]: Without dead ends: 261 [2025-03-17 13:29:55,099 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:29:55,099 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 5 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:55,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 747 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:55,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-17 13:29:55,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-03-17 13:29:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 187 states have (on average 1.5614973262032086) internal successors, (292), 256 states have internal predecessors, (292), 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:29:55,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 296 transitions. [2025-03-17 13:29:55,104 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 296 transitions. Word has length 57 [2025-03-17 13:29:55,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:55,105 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 296 transitions. [2025-03-17 13:29:55,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 296 transitions. [2025-03-17 13:29:55,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 13:29:55,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:55,105 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] [2025-03-17 13:29:55,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 13:29:55,105 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:55,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:55,105 INFO L85 PathProgramCache]: Analyzing trace with hash 200503212, now seen corresponding path program 1 times [2025-03-17 13:29:55,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:55,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98272574] [2025-03-17 13:29:55,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:55,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:55,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 13:29:55,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 13:29:55,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:55,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:55,552 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:55,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:55,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98272574] [2025-03-17 13:29:55,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98272574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:55,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:55,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:29:55,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651459367] [2025-03-17 13:29:55,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:55,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:29:55,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:55,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:29:55,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:29:55,554 INFO L87 Difference]: Start difference. First operand 261 states and 296 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:55,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:55,779 INFO L93 Difference]: Finished difference Result 269 states and 305 transitions. [2025-03-17 13:29:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 13:29:55,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-03-17 13:29:55,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:55,780 INFO L225 Difference]: With dead ends: 269 [2025-03-17 13:29:55,780 INFO L226 Difference]: Without dead ends: 269 [2025-03-17 13:29:55,781 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:29:55,781 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 14 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:55,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 833 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:29:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-17 13:29:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 267. [2025-03-17 13:29:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 193 states have (on average 1.549222797927461) internal successors, (299), 262 states have internal predecessors, (299), 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:29:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 303 transitions. [2025-03-17 13:29:55,787 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 303 transitions. Word has length 57 [2025-03-17 13:29:55,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:55,787 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 303 transitions. [2025-03-17 13:29:55,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 303 transitions. [2025-03-17 13:29:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 13:29:55,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:55,790 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:55,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 13:29:55,790 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:55,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:55,790 INFO L85 PathProgramCache]: Analyzing trace with hash 7573512, now seen corresponding path program 1 times [2025-03-17 13:29:55,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:55,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421376533] [2025-03-17 13:29:55,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:55,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:55,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 13:29:55,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 13:29:55,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:55,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:29:55,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:55,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421376533] [2025-03-17 13:29:55,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421376533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:29:55,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442799787] [2025-03-17 13:29:55,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:55,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:55,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:55,904 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:29:55,905 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:29:56,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 13:29:56,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 13:29:56,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:56,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:56,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 1267 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 13:29:56,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:29:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:29:56,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:29:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:29:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442799787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:29:56,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:29:56,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 13:29:56,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057652315] [2025-03-17 13:29:56,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:29:56,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:29:56,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:56,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:29:56,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:29:56,207 INFO L87 Difference]: Start difference. First operand 267 states and 303 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (1), 1 states 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,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:56,238 INFO L93 Difference]: Finished difference Result 294 states and 333 transitions. [2025-03-17 13:29:56,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:29:56,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2025-03-17 13:29:56,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:56,240 INFO L225 Difference]: With dead ends: 294 [2025-03-17 13:29:56,240 INFO L226 Difference]: Without dead ends: 294 [2025-03-17 13:29:56,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 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:29:56,240 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 14 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 705 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:29:56,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 705 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:29:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-17 13:29:56,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2025-03-17 13:29:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 217 states have (on average 1.5161290322580645) internal successors, (329), 286 states have internal predecessors, (329), 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:29:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 333 transitions. [2025-03-17 13:29:56,244 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 333 transitions. Word has length 61 [2025-03-17 13:29:56,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:56,244 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 333 transitions. [2025-03-17 13:29:56,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (1), 1 states 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,244 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 333 transitions. [2025-03-17 13:29:56,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 13:29:56,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:56,245 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:56,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 13:29:56,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:56,445 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:56,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:56,446 INFO L85 PathProgramCache]: Analyzing trace with hash 235025417, now seen corresponding path program 1 times [2025-03-17 13:29:56,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:56,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611150363] [2025-03-17 13:29:56,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:56,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:56,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 13:29:56,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 13:29:56,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:56,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:56,974 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:29:56,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:56,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611150363] [2025-03-17 13:29:56,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611150363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:29:56,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663953492] [2025-03-17 13:29:56,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:56,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:56,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:56,976 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:29:56,978 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:29:57,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 13:29:57,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 13:29:57,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:57,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:57,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 13:29:57,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:29:57,279 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:29:57,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-03-17 13:29:57,406 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 40 treesize of output 16 [2025-03-17 13:29:57,425 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:29:57,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:29:57,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:29:57,589 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 31 treesize of output 35 [2025-03-17 13:29:57,629 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:29:57,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663953492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:29:57,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:29:57,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-03-17 13:29:57,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145973127] [2025-03-17 13:29:57,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:29:57,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 13:29:57,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:57,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 13:29:57,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-03-17 13:29:57,630 INFO L87 Difference]: Start difference. First operand 291 states and 333 transitions. Second operand has 22 states, 21 states have (on average 3.0) internal successors, (63), 22 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:58,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:58,261 INFO L93 Difference]: Finished difference Result 290 states and 327 transitions. [2025-03-17 13:29:58,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:29:58,262 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 22 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-03-17 13:29:58,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:58,263 INFO L225 Difference]: With dead ends: 290 [2025-03-17 13:29:58,263 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 13:29:58,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2025-03-17 13:29:58,264 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 43 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:58,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 2000 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 13:29:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 13:29:58,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-03-17 13:29:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 217 states have (on average 1.4884792626728112) internal successors, (323), 285 states have internal predecessors, (323), 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:29:58,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 327 transitions. [2025-03-17 13:29:58,274 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 327 transitions. Word has length 62 [2025-03-17 13:29:58,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:58,274 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 327 transitions. [2025-03-17 13:29:58,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 22 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:58,274 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 327 transitions. [2025-03-17 13:29:58,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 13:29:58,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:58,274 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:58,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 13:29:58,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 13:29:58,479 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:58,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:58,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1966608325, now seen corresponding path program 2 times [2025-03-17 13:29:58,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:58,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087094028] [2025-03-17 13:29:58,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:29:58,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:58,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-17 13:29:58,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 13:29:58,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 13:29:58,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:29:58,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:58,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087094028] [2025-03-17 13:29:58,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087094028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:29:58,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154287450] [2025-03-17 13:29:58,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:29:58,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:58,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:58,738 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:29:58,739 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:29:58,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-17 13:29:59,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 13:29:59,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 13:29:59,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:59,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 13:29:59,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:29:59,047 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:29:59,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:29:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:29:59,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154287450] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:29:59,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:29:59,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 13:29:59,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748879585] [2025-03-17 13:29:59,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:29:59,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 13:29:59,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:59,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 13:29:59,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:29:59,106 INFO L87 Difference]: Start difference. First operand 290 states and 327 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:59,153 INFO L93 Difference]: Finished difference Result 359 states and 393 transitions. [2025-03-17 13:29:59,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:29:59,155 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2025-03-17 13:29:59,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:59,156 INFO L225 Difference]: With dead ends: 359 [2025-03-17 13:29:59,156 INFO L226 Difference]: Without dead ends: 359 [2025-03-17 13:29:59,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 146 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:29:59,157 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 26 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:59,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1178 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:29:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-17 13:29:59,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 350. [2025-03-17 13:29:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 277 states have (on average 1.404332129963899) internal successors, (389), 345 states have internal predecessors, (389), 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:29:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 393 transitions. [2025-03-17 13:29:59,162 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 393 transitions. Word has length 76 [2025-03-17 13:29:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:59,162 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 393 transitions. [2025-03-17 13:29:59,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:29:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 393 transitions. [2025-03-17 13:29:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 13:29:59,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:59,163 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] [2025-03-17 13:29:59,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 13:29:59,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:59,364 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:29:59,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:59,364 INFO L85 PathProgramCache]: Analyzing trace with hash -156330651, now seen corresponding path program 3 times [2025-03-17 13:29:59,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:59,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227526066] [2025-03-17 13:29:59,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 13:29:59,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:59,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 12 equivalence classes. [2025-03-17 13:29:59,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 106 statements. [2025-03-17 13:29:59,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 13:29:59,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:59,846 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:29:59,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:59,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227526066] [2025-03-17 13:29:59,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227526066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:29:59,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696044652] [2025-03-17 13:29:59,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 13:29:59,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:59,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:59,848 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:29:59,850 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:00,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 12 equivalence classes. [2025-03-17 13:30:00,163 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 106 statements. [2025-03-17 13:30:00,163 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 13:30:00,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:00,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 13:30:00,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:00,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:00,234 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:00,242 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:30:00,243 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:00,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:00,613 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:00,619 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:30:00,619 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:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-17 13:30:00,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:01,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:30:01,619 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 54 treesize of output 72 [2025-03-17 13:30:01,771 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 66 treesize of output 62 [2025-03-17 13:30:01,790 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-17 13:30:01,790 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 46 treesize of output 59 [2025-03-17 13:30:01,818 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:01,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696044652] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:01,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:01,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2025-03-17 13:30:01,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114981019] [2025-03-17 13:30:01,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:01,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 13:30:01,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:01,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 13:30:01,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-03-17 13:30:01,819 INFO L87 Difference]: Start difference. First operand 350 states and 393 transitions. Second operand has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:30:02,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:02,715 INFO L93 Difference]: Finished difference Result 353 states and 386 transitions. [2025-03-17 13:30:02,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:30:02,715 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 106 [2025-03-17 13:30:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:02,716 INFO L225 Difference]: With dead ends: 353 [2025-03-17 13:30:02,716 INFO L226 Difference]: Without dead ends: 353 [2025-03-17 13:30:02,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2025-03-17 13:30:02,717 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 842 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:02,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1506 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 13:30:02,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-17 13:30:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 291. [2025-03-17 13:30:02,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 222 states have (on average 1.4414414414414414) internal successors, (320), 286 states have internal predecessors, (320), 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:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 324 transitions. [2025-03-17 13:30:02,721 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 324 transitions. Word has length 106 [2025-03-17 13:30:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:02,721 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 324 transitions. [2025-03-17 13:30:02,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:30:02,721 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 324 transitions. [2025-03-17 13:30:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 13:30:02,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:02,722 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] [2025-03-17 13:30:02,730 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:02,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:02,923 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:02,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:02,923 INFO L85 PathProgramCache]: Analyzing trace with hash -156331579, now seen corresponding path program 1 times [2025-03-17 13:30:02,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:02,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225107597] [2025-03-17 13:30:02,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:02,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:02,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 13:30:02,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 13:30:02,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:02,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:03,404 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:03,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:03,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225107597] [2025-03-17 13:30:03,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225107597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:03,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172773941] [2025-03-17 13:30:03,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:03,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:03,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:03,408 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:03,409 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:03,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 13:30:03,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 13:30:03,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:03,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:03,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 13:30:03,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:03,803 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 13:30:03,803 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:03,813 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:30:03,814 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:03,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 13:30:04,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2025-03-17 13:30:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-17 13:30:04,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:04,378 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:04,396 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-17 13:30:04,397 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:04,422 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:04,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172773941] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:04,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:04,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 6] total 19 [2025-03-17 13:30:04,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144786052] [2025-03-17 13:30:04,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:04,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 13:30:04,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:04,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 13:30:04,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-03-17 13:30:04,424 INFO L87 Difference]: Start difference. First operand 291 states and 324 transitions. Second operand has 20 states, 19 states have (on average 4.0) 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:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:04,953 INFO L93 Difference]: Finished difference Result 354 states and 387 transitions. [2025-03-17 13:30:04,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:30:04,954 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.0) 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 106 [2025-03-17 13:30:04,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:04,955 INFO L225 Difference]: With dead ends: 354 [2025-03-17 13:30:04,955 INFO L226 Difference]: Without dead ends: 354 [2025-03-17 13:30:04,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=540, Unknown=0, NotChecked=0, Total=756 [2025-03-17 13:30:04,955 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 961 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:04,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 880 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 13:30:04,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-17 13:30:04,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 288. [2025-03-17 13:30:04,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 222 states have (on average 1.427927927927928) internal successors, (317), 283 states have internal predecessors, (317), 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:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 321 transitions. [2025-03-17 13:30:04,959 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 321 transitions. Word has length 106 [2025-03-17 13:30:04,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:04,959 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 321 transitions. [2025-03-17 13:30:04,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.0) 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:04,959 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 321 transitions. [2025-03-17 13:30:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 13:30:04,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:04,960 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:04,971 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:05,164 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,SelfDestructingSolverStorable24 [2025-03-17 13:30:05,164 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:05,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:05,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1501666646, now seen corresponding path program 1 times [2025-03-17 13:30:05,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:05,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180991364] [2025-03-17 13:30:05,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:05,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:05,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 13:30:05,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 13:30:05,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:05,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:06,143 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:06,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:06,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180991364] [2025-03-17 13:30:06,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180991364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:06,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662430086] [2025-03-17 13:30:06,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:06,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:06,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:06,173 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:06,175 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:06,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 13:30:06,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 13:30:06,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:06,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:06,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 13:30:06,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:06,541 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-17 13:30:06,542 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:06,551 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:06,561 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:06,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:06,721 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-03-17 13:30:06,722 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:06,730 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:30:06,730 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,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:07,392 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:07,424 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:30:07,424 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,487 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:07,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:08,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:30:08,422 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:08,658 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:08,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662430086] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:08,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:08,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2025-03-17 13:30:08,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159784758] [2025-03-17 13:30:08,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:08,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 13:30:08,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:08,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 13:30:08,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2025-03-17 13:30:08,660 INFO L87 Difference]: Start difference. First operand 288 states and 321 transitions. Second operand has 23 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 23 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:09,514 INFO L93 Difference]: Finished difference Result 408 states and 444 transitions. [2025-03-17 13:30:09,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 13:30:09,515 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 23 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2025-03-17 13:30:09,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:09,516 INFO L225 Difference]: With dead ends: 408 [2025-03-17 13:30:09,516 INFO L226 Difference]: Without dead ends: 408 [2025-03-17 13:30:09,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2025-03-17 13:30:09,517 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 755 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:09,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 923 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 13:30:09,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-17 13:30:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 283. [2025-03-17 13:30:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 218 states have (on average 1.4311926605504588) internal successors, (312), 278 states have internal predecessors, (312), 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:09,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 316 transitions. [2025-03-17 13:30:09,521 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 316 transitions. Word has length 109 [2025-03-17 13:30:09,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:09,522 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 316 transitions. [2025-03-17 13:30:09,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 23 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:09,522 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 316 transitions. [2025-03-17 13:30:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 13:30:09,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:09,522 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:09,532 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:09,723 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,SelfDestructingSolverStorable25 [2025-03-17 13:30:09,723 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:09,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:09,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1529343703, now seen corresponding path program 1 times [2025-03-17 13:30:09,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:09,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100160711] [2025-03-17 13:30:09,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:09,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:09,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 13:30:09,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 13:30:09,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:09,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:10,196 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:10,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:10,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100160711] [2025-03-17 13:30:10,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100160711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:10,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:10,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:30:10,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625795518] [2025-03-17 13:30:10,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:10,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:30:10,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:10,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:30:10,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:30:10,197 INFO L87 Difference]: Start difference. First operand 283 states and 316 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 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:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:10,340 INFO L93 Difference]: Finished difference Result 329 states and 373 transitions. [2025-03-17 13:30:10,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:30:10,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 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:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:10,342 INFO L225 Difference]: With dead ends: 329 [2025-03-17 13:30:10,342 INFO L226 Difference]: Without dead ends: 329 [2025-03-17 13:30:10,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 13:30:10,343 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 350 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:10,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 626 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:30:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-17 13:30:10,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 286. [2025-03-17 13:30:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 221 states have (on average 1.4298642533936652) internal successors, (316), 281 states have internal predecessors, (316), 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:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 320 transitions. [2025-03-17 13:30:10,347 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 320 transitions. Word has length 109 [2025-03-17 13:30:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:10,348 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 320 transitions. [2025-03-17 13:30:10,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 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:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 320 transitions. [2025-03-17 13:30:10,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 13:30:10,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:10,348 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:10,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 13:30:10,349 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:10,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:10,349 INFO L85 PathProgramCache]: Analyzing trace with hash -820665815, now seen corresponding path program 1 times [2025-03-17 13:30:10,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:10,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63292655] [2025-03-17 13:30:10,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:10,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 13:30:10,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 13:30:10,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:10,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:10,664 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:10,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:10,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63292655] [2025-03-17 13:30:10,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63292655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:10,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092534126] [2025-03-17 13:30:10,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:10,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:10,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:10,666 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:10,667 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:10,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 13:30:11,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 13:30:11,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:11,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:11,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 1550 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 13:30:11,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:11,198 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:11,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:11,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-17 13:30:11,363 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:11,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092534126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:11,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:11,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-17 13:30:11,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621771135] [2025-03-17 13:30:11,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:11,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 13:30:11,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:11,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 13:30:11,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-17 13:30:11,364 INFO L87 Difference]: Start difference. First operand 286 states and 320 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (1), 1 states 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:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:11,580 INFO L93 Difference]: Finished difference Result 409 states and 457 transitions. [2025-03-17 13:30:11,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 13:30:11,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (1), 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:11,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:11,582 INFO L225 Difference]: With dead ends: 409 [2025-03-17 13:30:11,582 INFO L226 Difference]: Without dead ends: 409 [2025-03-17 13:30:11,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:30:11,582 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 719 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:11,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 774 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:30:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-03-17 13:30:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 326. [2025-03-17 13:30:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 261 states have (on average 1.471264367816092) internal successors, (384), 320 states have internal predecessors, (384), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:30:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 390 transitions. [2025-03-17 13:30:11,586 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 390 transitions. Word has length 111 [2025-03-17 13:30:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:11,587 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 390 transitions. [2025-03-17 13:30:11,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (1), 1 states 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:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 390 transitions. [2025-03-17 13:30:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 13:30:11,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:11,587 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:11,598 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:11,787 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,SelfDestructingSolverStorable27 [2025-03-17 13:30:11,788 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:11,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:11,788 INFO L85 PathProgramCache]: Analyzing trace with hash 329163479, now seen corresponding path program 1 times [2025-03-17 13:30:11,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:11,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961301145] [2025-03-17 13:30:11,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:11,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:11,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 13:30:11,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 13:30:11,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:11,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:12,505 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:12,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:12,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961301145] [2025-03-17 13:30:12,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961301145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:12,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455813070] [2025-03-17 13:30:12,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:12,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:12,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:12,508 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:12,509 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:12,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 13:30:12,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 13:30:12,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:12,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:12,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 1558 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 13:30:12,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:12,920 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:12,954 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:13,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-17 13:30:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-17 13:30:13,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:13,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-17 13:30:13,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-17 13:30:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-17 13:30:13,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455813070] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:13,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:13,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 25 [2025-03-17 13:30:13,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567894093] [2025-03-17 13:30:13,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:13,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 13:30:13,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:13,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 13:30:13,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2025-03-17 13:30:13,343 INFO L87 Difference]: Start difference. First operand 326 states and 390 transitions. Second operand has 26 states, 25 states have (on average 3.44) internal successors, (86), 26 states have internal predecessors, (86), 1 states have call successors, (1), 1 states 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,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:13,598 INFO L93 Difference]: Finished difference Result 591 states and 721 transitions. [2025-03-17 13:30:13,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:30:13,598 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.44) internal successors, (86), 26 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2025-03-17 13:30:13,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:13,600 INFO L225 Difference]: With dead ends: 591 [2025-03-17 13:30:13,600 INFO L226 Difference]: Without dead ends: 591 [2025-03-17 13:30:13,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2025-03-17 13:30:13,600 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 605 mSDsluCounter, 2655 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 2870 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:13,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 2870 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:30:13,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-17 13:30:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 524. [2025-03-17 13:30:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 457 states have (on average 1.5054704595185995) internal successors, (688), 516 states have internal predecessors, (688), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 698 transitions. [2025-03-17 13:30:13,607 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 698 transitions. Word has length 112 [2025-03-17 13:30:13,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:13,607 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 698 transitions. [2025-03-17 13:30:13,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.44) internal successors, (86), 26 states have internal predecessors, (86), 1 states have call successors, (1), 1 states 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,607 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 698 transitions. [2025-03-17 13:30:13,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 13:30:13,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:13,608 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:13,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 13:30:13,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 13:30:13,809 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:13,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:13,809 INFO L85 PathProgramCache]: Analyzing trace with hash 329153581, now seen corresponding path program 1 times [2025-03-17 13:30:13,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:13,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941873838] [2025-03-17 13:30:13,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:13,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:13,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 13:30:13,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 13:30:13,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:13,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:13,954 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:13,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:13,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941873838] [2025-03-17 13:30:13,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941873838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:13,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:13,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:30:13,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096951912] [2025-03-17 13:30:13,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:13,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:13,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:13,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:13,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:13,956 INFO L87 Difference]: Start difference. First operand 524 states and 698 transitions. Second operand has 3 states, 2 states have (on average 19.0) 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:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:13,981 INFO L93 Difference]: Finished difference Result 523 states and 696 transitions. [2025-03-17 13:30:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:13,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) 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 112 [2025-03-17 13:30:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:13,982 INFO L225 Difference]: With dead ends: 523 [2025-03-17 13:30:13,982 INFO L226 Difference]: Without dead ends: 523 [2025-03-17 13:30:13,982 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:30:13,983 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 171 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:13,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 238 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-17 13:30:13,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-03-17 13:30:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 457 states have (on average 1.50109409190372) internal successors, (686), 515 states have internal predecessors, (686), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 696 transitions. [2025-03-17 13:30:13,989 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 696 transitions. Word has length 112 [2025-03-17 13:30:13,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:13,989 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 696 transitions. [2025-03-17 13:30:13,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) 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:13,989 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 696 transitions. [2025-03-17 13:30:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 13:30:13,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:13,990 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:13,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 13:30:13,990 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:13,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:13,990 INFO L85 PathProgramCache]: Analyzing trace with hash 334920120, now seen corresponding path program 1 times [2025-03-17 13:30:13,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:13,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739243246] [2025-03-17 13:30:13,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:13,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:14,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 13:30:14,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 13:30:14,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:14,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:14,359 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,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:14,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739243246] [2025-03-17 13:30:14,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739243246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:14,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:14,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 13:30:14,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683319608] [2025-03-17 13:30:14,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:14,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:30:14,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:14,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:30:14,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:30:14,364 INFO L87 Difference]: Start difference. First operand 523 states and 696 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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:14,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:14,428 INFO L93 Difference]: Finished difference Result 603 states and 816 transitions. [2025-03-17 13:30:14,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 13:30:14,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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 112 [2025-03-17 13:30:14,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:14,430 INFO L225 Difference]: With dead ends: 603 [2025-03-17 13:30:14,430 INFO L226 Difference]: Without dead ends: 603 [2025-03-17 13:30:14,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 13:30:14,435 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 40 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:14,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1258 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:14,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-17 13:30:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 531. [2025-03-17 13:30:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 465 states have (on average 1.4967741935483871) internal successors, (696), 523 states have internal predecessors, (696), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 706 transitions. [2025-03-17 13:30:14,441 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 706 transitions. Word has length 112 [2025-03-17 13:30:14,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:14,441 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 706 transitions. [2025-03-17 13:30:14,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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:14,442 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 706 transitions. [2025-03-17 13:30:14,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 13:30:14,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:14,442 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:14,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 13:30:14,442 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:14,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:14,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1344719647, now seen corresponding path program 1 times [2025-03-17 13:30:14,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:14,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924568499] [2025-03-17 13:30:14,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:14,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:14,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 13:30:14,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 13:30:14,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:14,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:15,692 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,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:15,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924568499] [2025-03-17 13:30:15,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924568499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:15,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603633548] [2025-03-17 13:30:15,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:15,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:15,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:15,695 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:15,697 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:15,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 13:30:16,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 13:30:16,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:16,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:16,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 13:30:16,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:16,088 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:16,091 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:16,135 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2025-03-17 13:30:16,135 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:16,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:30:16,139 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,556 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,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:16,907 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,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603633548] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:16,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:16,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2025-03-17 13:30:16,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716119913] [2025-03-17 13:30:16,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:16,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 13:30:16,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:16,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 13:30:16,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-17 13:30:16,908 INFO L87 Difference]: Start difference. First operand 531 states and 706 transitions. Second operand has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 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:17,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:17,339 INFO L93 Difference]: Finished difference Result 523 states and 639 transitions. [2025-03-17 13:30:17,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 13:30:17,340 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 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 113 [2025-03-17 13:30:17,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:17,341 INFO L225 Difference]: With dead ends: 523 [2025-03-17 13:30:17,341 INFO L226 Difference]: Without dead ends: 523 [2025-03-17 13:30:17,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2025-03-17 13:30:17,342 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 624 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:17,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 2314 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:30:17,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-17 13:30:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 488. [2025-03-17 13:30:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 422 states have (on average 1.4597156398104265) internal successors, (616), 480 states have internal predecessors, (616), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:17,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 626 transitions. [2025-03-17 13:30:17,354 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 626 transitions. Word has length 113 [2025-03-17 13:30:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:17,354 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 626 transitions. [2025-03-17 13:30:17,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 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:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 626 transitions. [2025-03-17 13:30:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 13:30:17,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:17,357 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:17,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 13:30:17,557 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,SelfDestructingSolverStorable31 [2025-03-17 13:30:17,558 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 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 1614133254, 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 [1493217287] [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,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 13:30:17,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 13:30:17,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:17,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:18,400 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,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:18,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493217287] [2025-03-17 13:30:18,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493217287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:18,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131754943] [2025-03-17 13:30:18,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:18,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:18,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:18,403 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:18,405 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:18,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 13:30:18,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 13:30:18,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:18,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:18,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 1560 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 13:30:18,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:18,865 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:18,876 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:18,883 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:19,023 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:19,025 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:19,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:19,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-17 13:30:19,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-17 13:30:19,146 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:19,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131754943] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:19,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:19,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 16 [2025-03-17 13:30:19,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219408185] [2025-03-17 13:30:19,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:19,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 13:30:19,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:19,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 13:30:19,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-17 13:30:19,147 INFO L87 Difference]: Start difference. First operand 488 states and 626 transitions. Second operand has 17 states, 16 states have (on average 4.6875) internal successors, (75), 17 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:19,359 INFO L93 Difference]: Finished difference Result 528 states and 646 transitions. [2025-03-17 13:30:19,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:30:19,359 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.6875) internal successors, (75), 17 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2025-03-17 13:30:19,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:19,361 INFO L225 Difference]: With dead ends: 528 [2025-03-17 13:30:19,361 INFO L226 Difference]: Without dead ends: 528 [2025-03-17 13:30:19,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-03-17 13:30:19,361 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 426 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:19,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1951 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:30:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-17 13:30:19,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 489. [2025-03-17 13:30:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 423 states have (on average 1.458628841607565) internal successors, (617), 481 states have internal predecessors, (617), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 627 transitions. [2025-03-17 13:30:19,369 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 627 transitions. Word has length 113 [2025-03-17 13:30:19,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:19,369 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 627 transitions. [2025-03-17 13:30:19,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.6875) internal successors, (75), 17 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 627 transitions. [2025-03-17 13:30:19,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 13:30:19,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:19,371 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:19,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 13:30:19,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-17 13:30:19,572 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:19,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:19,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1501476683, now seen corresponding path program 1 times [2025-03-17 13:30:19,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:19,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558508381] [2025-03-17 13:30:19,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:19,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:19,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 13:30:19,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 13:30:19,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:19,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2025-03-17 13:30:20,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:20,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558508381] [2025-03-17 13:30:20,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558508381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:20,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569662910] [2025-03-17 13:30:20,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:20,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:20,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:20,214 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:20,215 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:20,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 13:30:20,615 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,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:20,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:20,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 13:30:20,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:20,637 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:20,646 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:20,669 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 19 treesize of output 11 [2025-03-17 13:30:20,792 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:20,795 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-17 13:30:20,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:20,877 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-03-17 13:30:20,877 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 16 treesize of output 15 [2025-03-17 13:30:20,900 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 22 treesize of output 20 [2025-03-17 13:30:20,901 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 34 treesize of output 32 [2025-03-17 13:30:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-17 13:30:20,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569662910] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:20,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:20,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 17 [2025-03-17 13:30:20,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489682367] [2025-03-17 13:30:20,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:20,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 13:30:20,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:20,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 13:30:20,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-03-17 13:30:20,924 INFO L87 Difference]: Start difference. First operand 489 states and 627 transitions. Second operand has 18 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 18 states have internal predecessors, (86), 1 states have call successors, (1), 1 states 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:21,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:21,185 INFO L93 Difference]: Finished difference Result 518 states and 633 transitions. [2025-03-17 13:30:21,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:30:21,185 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 18 states have internal predecessors, (86), 1 states have call successors, (1), 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:21,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:21,186 INFO L225 Difference]: With dead ends: 518 [2025-03-17 13:30:21,186 INFO L226 Difference]: Without dead ends: 518 [2025-03-17 13:30:21,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2025-03-17 13:30:21,187 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 484 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:21,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1215 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:30:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-17 13:30:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 490. [2025-03-17 13:30:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 424 states have (on average 1.4575471698113207) internal successors, (618), 482 states have internal predecessors, (618), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 628 transitions. [2025-03-17 13:30:21,192 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 628 transitions. Word has length 114 [2025-03-17 13:30:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:21,192 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 628 transitions. [2025-03-17 13:30:21,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 18 states have internal predecessors, (86), 1 states have call successors, (1), 1 states 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:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 628 transitions. [2025-03-17 13:30:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 13:30:21,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:21,193 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:21,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 13:30:21,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:21,394 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:21,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash 403982821, now seen corresponding path program 1 times [2025-03-17 13:30:21,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:21,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459469197] [2025-03-17 13:30:21,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:21,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:21,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 13:30:21,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 13:30:21,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:21,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-17 13:30:21,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:21,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459469197] [2025-03-17 13:30:21,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459469197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:21,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:21,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:30:21,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460548622] [2025-03-17 13:30:21,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:21,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:21,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:21,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:21,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:21,518 INFO L87 Difference]: Start difference. First operand 490 states and 628 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:21,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:21,542 INFO L93 Difference]: Finished difference Result 489 states and 627 transitions. [2025-03-17 13:30:21,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:21,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2025-03-17 13:30:21,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:21,544 INFO L225 Difference]: With dead ends: 489 [2025-03-17 13:30:21,544 INFO L226 Difference]: Without dead ends: 489 [2025-03-17 13:30:21,544 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:30:21,544 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 174 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:21,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 231 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:21,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-17 13:30:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-03-17 13:30:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 424 states have (on average 1.455188679245283) internal successors, (617), 481 states have internal predecessors, (617), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 627 transitions. [2025-03-17 13:30:21,549 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 627 transitions. Word has length 115 [2025-03-17 13:30:21,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:21,550 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 627 transitions. [2025-03-17 13:30:21,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:21,550 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 627 transitions. [2025-03-17 13:30:21,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 13:30:21,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:21,550 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:21,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 13:30:21,550 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:21,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash 396851137, now seen corresponding path program 1 times [2025-03-17 13:30:21,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:21,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991723407] [2025-03-17 13:30:21,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:21,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:21,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 13:30:21,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 13:30:21,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:21,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:21,711 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:21,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:21,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991723407] [2025-03-17 13:30:21,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991723407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:21,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:21,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:30:21,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639963084] [2025-03-17 13:30:21,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:21,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:30:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:21,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:30:21,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:30:21,715 INFO L87 Difference]: Start difference. First operand 489 states and 627 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:21,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:21,730 INFO L93 Difference]: Finished difference Result 487 states and 618 transitions. [2025-03-17 13:30:21,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:30:21,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2025-03-17 13:30:21,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:21,733 INFO L225 Difference]: With dead ends: 487 [2025-03-17 13:30:21,733 INFO L226 Difference]: Without dead ends: 487 [2025-03-17 13:30:21,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:30:21,734 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:21,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 664 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:21,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-03-17 13:30:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2025-03-17 13:30:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 422 states have (on average 1.4407582938388626) internal successors, (608), 479 states have internal predecessors, (608), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 618 transitions. [2025-03-17 13:30:21,741 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 618 transitions. Word has length 115 [2025-03-17 13:30:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:21,741 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 618 transitions. [2025-03-17 13:30:21,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 618 transitions. [2025-03-17 13:30:21,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 13:30:21,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:21,742 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] [2025-03-17 13:30:21,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 13:30:21,742 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:21,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:21,742 INFO L85 PathProgramCache]: Analyzing trace with hash 189919218, now seen corresponding path program 1 times [2025-03-17 13:30:21,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:21,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105651161] [2025-03-17 13:30:21,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:21,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:21,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 13:30:21,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 13:30:21,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:21,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-17 13:30:21,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105651161] [2025-03-17 13:30:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105651161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76586757] [2025-03-17 13:30:21,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:21,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:21,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:21,976 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:21,977 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:22,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 13:30:22,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 13:30:22,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:22,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:22,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 1568 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 13:30:22,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-17 13:30:22,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-17 13:30:22,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76586757] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:22,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:22,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-17 13:30:22,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225613252] [2025-03-17 13:30:22,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:22,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 13:30:22,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:22,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 13:30:22,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:30:22,539 INFO L87 Difference]: Start difference. First operand 487 states and 618 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (1), 1 states 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:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:22,604 INFO L93 Difference]: Finished difference Result 567 states and 679 transitions. [2025-03-17 13:30:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 13:30:22,605 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2025-03-17 13:30:22,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:22,606 INFO L225 Difference]: With dead ends: 567 [2025-03-17 13:30:22,606 INFO L226 Difference]: Without dead ends: 567 [2025-03-17 13:30:22,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 225 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:30:22,607 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 93 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:22,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1273 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:30:22,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-17 13:30:22,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 488. [2025-03-17 13:30:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 423 states have (on average 1.4397163120567376) internal successors, (609), 480 states have internal predecessors, (609), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 619 transitions. [2025-03-17 13:30:22,614 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 619 transitions. Word has length 116 [2025-03-17 13:30:22,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:22,614 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 619 transitions. [2025-03-17 13:30:22,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (1), 1 states 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:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 619 transitions. [2025-03-17 13:30:22,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 13:30:22,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:22,614 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:22,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 13:30:22,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-17 13:30:22,815 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:22,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:22,815 INFO L85 PathProgramCache]: Analyzing trace with hash -361434455, now seen corresponding path program 1 times [2025-03-17 13:30:22,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:22,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810943143] [2025-03-17 13:30:22,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:22,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:22,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 13:30:22,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 13:30:22,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:22,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:23,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:23,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:23,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810943143] [2025-03-17 13:30:23,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810943143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:23,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480760841] [2025-03-17 13:30:23,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:23,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:23,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:23,021 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:23,022 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:23,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 13:30:23,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 13:30:23,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:23,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:23,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 1561 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 13:30:23,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:23,502 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:23,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:23,566 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:23,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480760841] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:23,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:23,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-17 13:30:23,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366463727] [2025-03-17 13:30:23,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:23,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 13:30:23,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:23,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 13:30:23,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 13:30:23,567 INFO L87 Difference]: Start difference. First operand 488 states and 619 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (1), 1 states 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,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:23,626 INFO L93 Difference]: Finished difference Result 491 states and 618 transitions. [2025-03-17 13:30:23,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:30:23,626 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2025-03-17 13:30:23,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:23,628 INFO L225 Difference]: With dead ends: 491 [2025-03-17 13:30:23,628 INFO L226 Difference]: Without dead ends: 491 [2025-03-17 13:30:23,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 227 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:30:23,628 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 209 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:23,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1069 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:23,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-17 13:30:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 485. [2025-03-17 13:30:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 420 states have (on average 1.4333333333333333) internal successors, (602), 477 states have internal predecessors, (602), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 612 transitions. [2025-03-17 13:30:23,633 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 612 transitions. Word has length 116 [2025-03-17 13:30:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:23,635 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 612 transitions. [2025-03-17 13:30:23,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (1), 1 states 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,635 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 612 transitions. [2025-03-17 13:30:23,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 13:30:23,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:23,636 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:23,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 13:30:23,836 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,SelfDestructingSolverStorable37 [2025-03-17 13:30:23,836 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:23,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:23,837 INFO L85 PathProgramCache]: Analyzing trace with hash -878123565, now seen corresponding path program 1 times [2025-03-17 13:30:23,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:23,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055358132] [2025-03-17 13:30:23,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:23,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:23,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 13:30:23,889 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,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:23,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:23,979 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:23,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:23,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055358132] [2025-03-17 13:30:23,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055358132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:23,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:23,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:30:23,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789570435] [2025-03-17 13:30:23,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:23,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:23,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:23,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:23,981 INFO L87 Difference]: Start difference. First operand 485 states and 612 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 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:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:24,052 INFO L93 Difference]: Finished difference Result 484 states and 610 transitions. [2025-03-17 13:30:24,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:24,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 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 117 [2025-03-17 13:30:24,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:24,054 INFO L225 Difference]: With dead ends: 484 [2025-03-17 13:30:24,054 INFO L226 Difference]: Without dead ends: 484 [2025-03-17 13:30:24,054 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:30:24,055 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 1 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:24,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 371 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:30:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-17 13:30:24,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2025-03-17 13:30:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 420 states have (on average 1.4285714285714286) internal successors, (600), 476 states have internal predecessors, (600), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 610 transitions. [2025-03-17 13:30:24,061 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 610 transitions. Word has length 117 [2025-03-17 13:30:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:24,061 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 610 transitions. [2025-03-17 13:30:24,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 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:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 610 transitions. [2025-03-17 13:30:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 13:30:24,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:24,062 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:24,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 13:30:24,063 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:24,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash -878123564, now seen corresponding path program 1 times [2025-03-17 13:30:24,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:24,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518473378] [2025-03-17 13:30:24,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:24,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:24,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 13:30:24,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 13:30:24,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:24,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:24,246 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:24,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:24,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518473378] [2025-03-17 13:30:24,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518473378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:24,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:24,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:30:24,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624977644] [2025-03-17 13:30:24,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:24,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:24,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:24,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:24,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:24,247 INFO L87 Difference]: Start difference. First operand 484 states and 610 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 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:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:24,329 INFO L93 Difference]: Finished difference Result 483 states and 608 transitions. [2025-03-17 13:30:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:24,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 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 117 [2025-03-17 13:30:24,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:24,330 INFO L225 Difference]: With dead ends: 483 [2025-03-17 13:30:24,330 INFO L226 Difference]: Without dead ends: 483 [2025-03-17 13:30:24,330 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:30:24,331 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:24,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:30:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-17 13:30:24,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2025-03-17 13:30:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 420 states have (on average 1.4238095238095239) internal successors, (598), 475 states have internal predecessors, (598), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 608 transitions. [2025-03-17 13:30:24,337 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 608 transitions. Word has length 117 [2025-03-17 13:30:24,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:24,338 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 608 transitions. [2025-03-17 13:30:24,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 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:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 608 transitions. [2025-03-17 13:30:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 13:30:24,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:24,338 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:24,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 13:30:24,339 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:24,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:24,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2123435185, now seen corresponding path program 1 times [2025-03-17 13:30:24,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:24,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271766317] [2025-03-17 13:30:24,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:24,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:24,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 13:30:24,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 13:30:24,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:24,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:25,243 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:25,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:25,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271766317] [2025-03-17 13:30:25,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271766317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:25,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464670923] [2025-03-17 13:30:25,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:25,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:25,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:25,245 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:25,246 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:25,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 13:30:25,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 13:30:25,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:25,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:25,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 1572 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 13:30:25,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:25,700 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:25,708 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:25,726 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:30:25,727 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,733 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:25,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-17 13:30:25,750 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:25,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-17 13:30:25,944 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,948 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:25,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:26,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-17 13:30:26,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 13:30:26,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-17 13:30:26,170 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:26,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464670923] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:26,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:26,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2025-03-17 13:30:26,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757874135] [2025-03-17 13:30:26,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:26,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 13:30:26,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:26,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 13:30:26,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-03-17 13:30:26,171 INFO L87 Difference]: Start difference. First operand 483 states and 608 transitions. Second operand has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 1 states have call successors, (1), 1 states 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:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:26,511 INFO L93 Difference]: Finished difference Result 513 states and 621 transitions. [2025-03-17 13:30:26,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:30:26,511 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2025-03-17 13:30:26,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:26,513 INFO L225 Difference]: With dead ends: 513 [2025-03-17 13:30:26,513 INFO L226 Difference]: Without dead ends: 513 [2025-03-17 13:30:26,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2025-03-17 13:30:26,514 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 574 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:26,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1282 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:30:26,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-17 13:30:26,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 486. [2025-03-17 13:30:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 423 states have (on average 1.42080378250591) internal successors, (601), 478 states have internal predecessors, (601), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 611 transitions. [2025-03-17 13:30:26,520 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 611 transitions. Word has length 118 [2025-03-17 13:30:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:26,520 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 611 transitions. [2025-03-17 13:30:26,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 1 states have call successors, (1), 1 states 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:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 611 transitions. [2025-03-17 13:30:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 13:30:26,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:26,521 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:26,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-17 13:30:26,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:26,722 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:26,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:26,722 INFO L85 PathProgramCache]: Analyzing trace with hash 463006717, now seen corresponding path program 1 times [2025-03-17 13:30:26,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:26,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358150072] [2025-03-17 13:30:26,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:26,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:26,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 13:30:26,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 13:30:26,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:26,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:26,879 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:26,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358150072] [2025-03-17 13:30:26,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358150072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:26,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:26,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:30:26,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737022287] [2025-03-17 13:30:26,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:26,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:30:26,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:26,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:30:26,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:30:26,880 INFO L87 Difference]: Start difference. First operand 486 states and 611 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:26,894 INFO L93 Difference]: Finished difference Result 484 states and 603 transitions. [2025-03-17 13:30:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:30:26,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2025-03-17 13:30:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:26,896 INFO L225 Difference]: With dead ends: 484 [2025-03-17 13:30:26,896 INFO L226 Difference]: Without dead ends: 484 [2025-03-17 13:30:26,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:30:26,896 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 2 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:26,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 653 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-17 13:30:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 478. [2025-03-17 13:30:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 415 states have (on average 1.4096385542168675) internal successors, (585), 470 states have internal predecessors, (585), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 595 transitions. [2025-03-17 13:30:26,901 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 595 transitions. Word has length 120 [2025-03-17 13:30:26,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:26,901 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 595 transitions. [2025-03-17 13:30:26,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 595 transitions. [2025-03-17 13:30:26,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 13:30:26,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:26,902 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:26,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-17 13:30:26,902 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:26,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:26,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1315720417, now seen corresponding path program 1 times [2025-03-17 13:30:26,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:26,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667649769] [2025-03-17 13:30:26,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:26,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:26,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 13:30:27,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 13:30:27,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:27,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:27,985 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:27,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:27,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667649769] [2025-03-17 13:30:27,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667649769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:27,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509789928] [2025-03-17 13:30:27,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:27,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:27,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:27,987 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:27,988 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:28,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 13:30:28,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 13:30:28,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:28,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:28,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 13:30:28,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:28,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-17 13:30:28,491 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:30:28,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 13:30:28,501 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:28,538 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 11 [2025-03-17 13:30:28,597 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 20 treesize of output 12 [2025-03-17 13:30:28,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-17 13:30:28,881 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:28,893 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:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-17 13:30:28,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:29,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-17 13:30:29,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-17 13:30:29,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-17 13:30:29,255 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 13:30:29,255 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:29,265 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:29,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509789928] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:29,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:29,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 24 [2025-03-17 13:30:29,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785952314] [2025-03-17 13:30:29,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:29,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 13:30:29,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:29,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 13:30:29,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-03-17 13:30:29,266 INFO L87 Difference]: Start difference. First operand 478 states and 595 transitions. Second operand has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 1 states have call successors, (1), 1 states 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:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:29,548 INFO L93 Difference]: Finished difference Result 509 states and 608 transitions. [2025-03-17 13:30:29,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:30:29,548 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2025-03-17 13:30:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:29,549 INFO L225 Difference]: With dead ends: 509 [2025-03-17 13:30:29,549 INFO L226 Difference]: Without dead ends: 509 [2025-03-17 13:30:29,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2025-03-17 13:30:29,550 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 710 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:29,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 929 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:30:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-17 13:30:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 481. [2025-03-17 13:30:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 418 states have (on average 1.4066985645933014) internal successors, (588), 473 states have internal predecessors, (588), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:29,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 598 transitions. [2025-03-17 13:30:29,555 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 598 transitions. Word has length 121 [2025-03-17 13:30:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:29,555 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 598 transitions. [2025-03-17 13:30:29,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 1 states have call successors, (1), 1 states 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:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 598 transitions. [2025-03-17 13:30:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 13:30:29,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:29,556 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:29,568 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:29,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:29,760 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:29,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:29,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1468058160, now seen corresponding path program 1 times [2025-03-17 13:30:29,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:29,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168712163] [2025-03-17 13:30:29,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:29,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:29,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 13:30:29,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 13:30:29,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:29,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:30,027 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:30,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:30,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168712163] [2025-03-17 13:30:30,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168712163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:30,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661560931] [2025-03-17 13:30:30,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:30,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:30,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:30,031 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:30,032 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:30,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 13:30:30,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 13:30:30,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:30,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:30,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1624 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 13:30:30,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:30,638 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:30,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:30,891 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:30,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661560931] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:30,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:30,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-17 13:30:30,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208867031] [2025-03-17 13:30:30,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:30,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 13:30:30,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:30,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 13:30:30,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 13:30:30,893 INFO L87 Difference]: Start difference. First operand 481 states and 598 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:30,987 INFO L93 Difference]: Finished difference Result 456 states and 517 transitions. [2025-03-17 13:30:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:30:30,988 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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 121 [2025-03-17 13:30:30,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:30,989 INFO L225 Difference]: With dead ends: 456 [2025-03-17 13:30:30,989 INFO L226 Difference]: Without dead ends: 456 [2025-03-17 13:30:30,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:30:30,989 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 59 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:30,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1071 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:30:30,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-17 13:30:30,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 397. [2025-03-17 13:30:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 336 states have (on average 1.3422619047619047) internal successors, (451), 391 states have internal predecessors, (451), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:30:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 457 transitions. [2025-03-17 13:30:30,995 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 457 transitions. Word has length 121 [2025-03-17 13:30:30,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:30,995 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 457 transitions. [2025-03-17 13:30:30,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 457 transitions. [2025-03-17 13:30:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 13:30:30,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:30,996 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:31,008 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:31,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:31,197 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:31,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:31,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2132627283, now seen corresponding path program 1 times [2025-03-17 13:30:31,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:31,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229503826] [2025-03-17 13:30:31,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:31,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:31,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 13:30:31,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 13:30:31,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:31,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-17 13:30:31,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:31,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229503826] [2025-03-17 13:30:31,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229503826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:31,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:31,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:30:31,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83321336] [2025-03-17 13:30:31,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:31,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:31,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:31,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:31,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:31,379 INFO L87 Difference]: Start difference. First operand 397 states and 457 transitions. Second operand has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:31,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:31,390 INFO L93 Difference]: Finished difference Result 396 states and 456 transitions. [2025-03-17 13:30:31,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:31,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2025-03-17 13:30:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:31,391 INFO L225 Difference]: With dead ends: 396 [2025-03-17 13:30:31,391 INFO L226 Difference]: Without dead ends: 396 [2025-03-17 13:30:31,391 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:30:31,392 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 167 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:31,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 230 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-17 13:30:31,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2025-03-17 13:30:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 336 states have (on average 1.3392857142857142) internal successors, (450), 390 states have internal predecessors, (450), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:30:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 456 transitions. [2025-03-17 13:30:31,395 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 456 transitions. Word has length 122 [2025-03-17 13:30:31,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:31,395 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 456 transitions. [2025-03-17 13:30:31,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:31,396 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 456 transitions. [2025-03-17 13:30:31,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 13:30:31,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:31,396 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:31,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-17 13:30:31,396 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:31,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:31,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1686936355, now seen corresponding path program 1 times [2025-03-17 13:30:31,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:31,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95470364] [2025-03-17 13:30:31,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:31,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:31,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 13:30:31,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 13:30:31,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:31,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-17 13:30:31,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:31,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95470364] [2025-03-17 13:30:31,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95470364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:31,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:31,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:30:31,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435772012] [2025-03-17 13:30:31,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:31,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:31,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:31,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:31,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:31,523 INFO L87 Difference]: Start difference. First operand 396 states and 456 transitions. Second operand has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:31,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:31,536 INFO L93 Difference]: Finished difference Result 395 states and 455 transitions. [2025-03-17 13:30:31,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:31,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2025-03-17 13:30:31,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:31,537 INFO L225 Difference]: With dead ends: 395 [2025-03-17 13:30:31,537 INFO L226 Difference]: Without dead ends: 395 [2025-03-17 13:30:31,537 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:30:31,538 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 168 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:31,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 214 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:30:31,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-17 13:30:31,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2025-03-17 13:30:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 336 states have (on average 1.3363095238095237) internal successors, (449), 389 states have internal predecessors, (449), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:30:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 455 transitions. [2025-03-17 13:30:31,541 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 455 transitions. Word has length 123 [2025-03-17 13:30:31,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:31,541 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 455 transitions. [2025-03-17 13:30:31,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:31,541 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 455 transitions. [2025-03-17 13:30:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 13:30:31,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:31,541 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:31,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-17 13:30:31,542 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:31,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:31,542 INFO L85 PathProgramCache]: Analyzing trace with hash -755419477, now seen corresponding path program 1 times [2025-03-17 13:30:31,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:31,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188401532] [2025-03-17 13:30:31,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:31,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:31,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 13:30:31,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 13:30:31,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:31,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:33,279 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:33,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:33,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188401532] [2025-03-17 13:30:33,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188401532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:33,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352162693] [2025-03-17 13:30:33,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:33,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:33,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:33,282 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:33,283 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:33,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 13:30:33,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 13:30:33,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:33,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:33,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 1586 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-17 13:30:33,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:33,781 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:33,854 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2025-03-17 13:30:33,854 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 6 case distinctions, treesize of input 31 treesize of output 32 [2025-03-17 13:30:33,934 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-17 13:30:33,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-17 13:30:33,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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:34,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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:34,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 28 treesize of output 16 [2025-03-17 13:30:35,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2025-03-17 13:30:35,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-03-17 13:30:35,214 INFO L349 Elim1Store]: treesize reduction 36, result has 21.7 percent of original size [2025-03-17 13:30:35,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 32 [2025-03-17 13:30:35,269 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2025-03-17 13:30:35,269 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 24 treesize of output 24 [2025-03-17 13:30:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-17 13:30:35,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:35,895 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 53 treesize of output 49 [2025-03-17 13:30:35,897 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 74 treesize of output 70 [2025-03-17 13:30:37,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352162693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:37,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:30:37,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2025-03-17 13:30:37,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692554523] [2025-03-17 13:30:37,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:37,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 13:30:37,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:37,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 13:30:37,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1208, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 13:30:37,092 INFO L87 Difference]: Start difference. First operand 395 states and 455 transitions. Second operand has 29 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 29 states have internal predecessors, (99), 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:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:37,895 INFO L93 Difference]: Finished difference Result 417 states and 477 transitions. [2025-03-17 13:30:37,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 13:30:37,895 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 29 states have internal predecessors, (99), 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 124 [2025-03-17 13:30:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:37,896 INFO L225 Difference]: With dead ends: 417 [2025-03-17 13:30:37,896 INFO L226 Difference]: Without dead ends: 417 [2025-03-17 13:30:37,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=315, Invalid=1325, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 13:30:37,897 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 599 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:37,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 2022 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 13:30:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-17 13:30:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 398. [2025-03-17 13:30:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 339 states have (on average 1.3333333333333333) internal successors, (452), 392 states have internal predecessors, (452), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:30:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 458 transitions. [2025-03-17 13:30:37,900 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 458 transitions. Word has length 124 [2025-03-17 13:30:37,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:37,900 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 458 transitions. [2025-03-17 13:30:37,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 29 states have internal predecessors, (99), 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:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 458 transitions. [2025-03-17 13:30:37,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 13:30:37,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:37,901 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:37,911 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:38,101 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,SelfDestructingSolverStorable46 [2025-03-17 13:30:38,102 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-03-17 13:30:38,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:38,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1943167333, now seen corresponding path program 1 times [2025-03-17 13:30:38,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:38,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823499433] [2025-03-17 13:30:38,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:38,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:38,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 13:30:38,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 13:30:38,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:38,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:40,921 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:40,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:40,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823499433] [2025-03-17 13:30:40,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823499433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:40,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903289500] [2025-03-17 13:30:40,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:40,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:40,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:40,923 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:40,926 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:41,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 13:30:41,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 13:30:41,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:41,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:41,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 1591 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-17 13:30:41,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:41,541 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:42,341 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:43,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-17 13:30:49,186 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 551 treesize of output 439 [2025-03-17 13:30:52,115 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 547 treesize of output 435