./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:09:31,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:09:31,685 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 23:09:31,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:09:31,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:09:31,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:09:31,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:09:31,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:09:31,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:09:31,715 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:09:31,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:09:31,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:09:31,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:09:31,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:09:31,717 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:09:31,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:09:31,717 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:09:31,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:09:31,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:09:31,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:09:31,718 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:09:31,718 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:09:31,718 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:09:31,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:09:31,718 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:09:31,718 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:09:31,718 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:09:31,718 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:09:31,718 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:09:31,718 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:09:31,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:09:31,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:09:31,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:09:31,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:09:31,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:09:31,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:09:31,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:09:31,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:09:31,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:09:31,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:09:31,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:09:31,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:09:31,720 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2025-03-08 23:09:31,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:09:31,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:09:31,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:09:31,957 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:09:31,957 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:09:31,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2025-03-08 23:09:33,079 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5e5cf24c/677de1c6dde848b38e575f57dccf686f/FLAG5f1209a92 [2025-03-08 23:09:33,319 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:09:33,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2025-03-08 23:09:33,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5e5cf24c/677de1c6dde848b38e575f57dccf686f/FLAG5f1209a92 [2025-03-08 23:09:33,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5e5cf24c/677de1c6dde848b38e575f57dccf686f [2025-03-08 23:09:33,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:09:33,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:09:33,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:09:33,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:09:33,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:09:33,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@114dd450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33, skipping insertion in model container [2025-03-08 23:09:33,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:09:33,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:09:33,841 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:09:33,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:09:33,899 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:09:33,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33 WrapperNode [2025-03-08 23:09:33,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:09:33,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:09:33,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:09:33,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:09:33,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,940 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 160 [2025-03-08 23:09:33,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:09:33,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:09:33,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:09:33,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:09:33,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,962 INFO L175 MemorySlicer]: Split 28 memory accesses to 3 slices as follows [2, 10, 16]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 1, 7]. [2025-03-08 23:09:33,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,975 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:09:33,984 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:09:33,987 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:09:33,987 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:09:33,988 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:09:34,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:34,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 23:09:34,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-08 23:09:34,029 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 23:09:34,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 23:09:34,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 23:09:34,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:09:34,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:09:34,134 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:09:34,136 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:09:34,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L623: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-08 23:09:34,396 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-08 23:09:34,412 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-08 23:09:34,412 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:09:34,421 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:09:34,421 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:09:34,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:09:34 BoogieIcfgContainer [2025-03-08 23:09:34,423 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:09:34,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:09:34,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:09:34,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:09:34,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:09:33" (1/3) ... [2025-03-08 23:09:34,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc780e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:09:34, skipping insertion in model container [2025-03-08 23:09:34,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (2/3) ... [2025-03-08 23:09:34,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc780e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:09:34, skipping insertion in model container [2025-03-08 23:09:34,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:09:34" (3/3) ... [2025-03-08 23:09:34,431 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2025-03-08 23:09:34,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:09:34,443 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_append_unequal.i that has 2 procedures, 135 locations, 1 initial locations, 5 loop locations, and 58 error locations. [2025-03-08 23:09:34,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:09:34,475 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;@42f463e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:09:34,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-03-08 23:09:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 72 states have (on average 2.013888888888889) internal successors, (145), 130 states have internal predecessors, (145), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:09:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:09:34,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:34,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:09:34,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:34,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:34,487 INFO L85 PathProgramCache]: Analyzing trace with hash 822655764, now seen corresponding path program 1 times [2025-03-08 23:09:34,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:34,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015631612] [2025-03-08 23:09:34,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:34,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:09:34,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:09:34,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:34,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:34,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:34,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:34,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015631612] [2025-03-08 23:09:34,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015631612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:34,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:34,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:09:34,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657677903] [2025-03-08 23:09:34,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:34,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:09:34,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:34,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:09:34,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:34,682 INFO L87 Difference]: Start difference. First operand has 135 states, 72 states have (on average 2.013888888888889) internal successors, (145), 130 states have internal predecessors, (145), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:34,795 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2025-03-08 23:09:34,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:09:34,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 23:09:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:34,800 INFO L225 Difference]: With dead ends: 132 [2025-03-08 23:09:34,801 INFO L226 Difference]: Without dead ends: 129 [2025-03-08 23:09:34,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:34,803 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:34,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 216 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-08 23:09:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-08 23:09:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 69 states have (on average 1.9275362318840579) internal successors, (133), 124 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:09:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2025-03-08 23:09:34,832 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 6 [2025-03-08 23:09:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:34,832 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2025-03-08 23:09:34,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2025-03-08 23:09:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:09:34,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:34,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:09:34,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:09:34,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:34,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:34,833 INFO L85 PathProgramCache]: Analyzing trace with hash 822655765, now seen corresponding path program 1 times [2025-03-08 23:09:34,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370236915] [2025-03-08 23:09:34,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:34,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:34,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:09:34,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:09:34,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:34,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:34,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:34,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:34,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370236915] [2025-03-08 23:09:34,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370236915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:34,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:34,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:09:34,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532337847] [2025-03-08 23:09:34,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:34,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:09:34,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:34,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:09:34,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:34,920 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:35,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:35,003 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2025-03-08 23:09:35,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:09:35,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 23:09:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:35,005 INFO L225 Difference]: With dead ends: 127 [2025-03-08 23:09:35,005 INFO L226 Difference]: Without dead ends: 127 [2025-03-08 23:09:35,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:35,006 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 2 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:35,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 217 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-08 23:09:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-08 23:09:35,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 69 states have (on average 1.8985507246376812) internal successors, (131), 122 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:09:35,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2025-03-08 23:09:35,016 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 6 [2025-03-08 23:09:35,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:35,016 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2025-03-08 23:09:35,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:09:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2025-03-08 23:09:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 23:09:35,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:35,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:35,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:09:35,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:35,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:35,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1931660426, now seen corresponding path program 1 times [2025-03-08 23:09:35,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:35,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880219490] [2025-03-08 23:09:35,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:35,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:35,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 23:09:35,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 23:09:35,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:35,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:35,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:35,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880219490] [2025-03-08 23:09:35,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880219490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:35,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:35,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:09:35,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195042995] [2025-03-08 23:09:35,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:35,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:09:35,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:35,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:09:35,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:35,096 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:09:35,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:35,105 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2025-03-08 23:09:35,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:09:35,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 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 13 [2025-03-08 23:09:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:35,109 INFO L225 Difference]: With dead ends: 134 [2025-03-08 23:09:35,109 INFO L226 Difference]: Without dead ends: 134 [2025-03-08 23:09:35,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:35,109 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 5 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:35,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 265 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-08 23:09:35,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2025-03-08 23:09:35,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 70 states have (on average 1.8857142857142857) internal successors, (132), 123 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:09:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2025-03-08 23:09:35,115 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 13 [2025-03-08 23:09:35,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:35,115 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2025-03-08 23:09:35,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:09:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2025-03-08 23:09:35,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:09:35,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:35,116 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:35,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 23:09:35,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:35,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:35,117 INFO L85 PathProgramCache]: Analyzing trace with hash 860661070, now seen corresponding path program 1 times [2025-03-08 23:09:35,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:35,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214889841] [2025-03-08 23:09:35,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:35,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:35,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 23:09:35,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 23:09:35,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:35,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:09:35,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:35,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214889841] [2025-03-08 23:09:35,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214889841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:35,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:35,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:09:35,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261847203] [2025-03-08 23:09:35,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:35,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:09:35,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:35,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:09:35,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:09:35,229 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 23:09:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:35,401 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2025-03-08 23:09:35,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:09:35,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-08 23:09:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:35,403 INFO L225 Difference]: With dead ends: 127 [2025-03-08 23:09:35,403 INFO L226 Difference]: Without dead ends: 127 [2025-03-08 23:09:35,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:09:35,403 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 2 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:35,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 413 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:09:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-08 23:09:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-08 23:09:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 70 states have (on average 1.8714285714285714) internal successors, (131), 122 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:09:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2025-03-08 23:09:35,430 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 22 [2025-03-08 23:09:35,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:35,430 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2025-03-08 23:09:35,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 23:09:35,430 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2025-03-08 23:09:35,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:09:35,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:35,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:35,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:09:35,431 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:35,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:35,432 INFO L85 PathProgramCache]: Analyzing trace with hash 860661071, now seen corresponding path program 1 times [2025-03-08 23:09:35,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:35,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345834965] [2025-03-08 23:09:35,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:35,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:35,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 23:09:35,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 23:09:35,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:35,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:35,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:35,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345834965] [2025-03-08 23:09:35,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345834965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:35,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:35,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:09:35,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210553426] [2025-03-08 23:09:35,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:35,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:09:35,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:35,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:09:35,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:09:35,584 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 23:09:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:35,731 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2025-03-08 23:09:35,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:09:35,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-08 23:09:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:35,733 INFO L225 Difference]: With dead ends: 126 [2025-03-08 23:09:35,733 INFO L226 Difference]: Without dead ends: 126 [2025-03-08 23:09:35,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:09:35,734 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:35,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 437 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:35,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-08 23:09:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-08 23:09:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 70 states have (on average 1.8571428571428572) internal successors, (130), 121 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:09:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2025-03-08 23:09:35,743 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 22 [2025-03-08 23:09:35,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:35,743 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2025-03-08 23:09:35,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 23:09:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2025-03-08 23:09:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:09:35,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:35,744 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:35,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 23:09:35,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:35,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:35,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1000719250, now seen corresponding path program 1 times [2025-03-08 23:09:35,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:35,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150800626] [2025-03-08 23:09:35,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:35,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:09:35,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:09:35,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:35,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:35,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:35,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150800626] [2025-03-08 23:09:35,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150800626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:35,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585821365] [2025-03-08 23:09:35,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:35,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:35,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:35,959 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:09:35,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 23:09:36,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:09:36,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:09:36,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:36,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:36,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 23:09:36,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:36,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:09:36,138 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-03-08 23:09:36,195 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 23:09:36,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-08 23:09:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-08 23:09:36,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:36,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585821365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:36,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:09:36,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-03-08 23:09:36,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632872879] [2025-03-08 23:09:36,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:36,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 23:09:36,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:36,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 23:09:36,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-03-08 23:09:36,271 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:09:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:36,540 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2025-03-08 23:09:36,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:09:36,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-08 23:09:36,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:36,542 INFO L225 Difference]: With dead ends: 125 [2025-03-08 23:09:36,542 INFO L226 Difference]: Without dead ends: 125 [2025-03-08 23:09:36,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-03-08 23:09:36,542 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 2 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:36,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 607 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 432 Invalid, 0 Unknown, 128 Unchecked, 0.2s Time] [2025-03-08 23:09:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-08 23:09:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-08 23:09:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 120 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:09:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2025-03-08 23:09:36,547 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 25 [2025-03-08 23:09:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:36,547 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2025-03-08 23:09:36,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:09:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2025-03-08 23:09:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:09:36,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:36,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:36,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 23:09:36,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 23:09:36,748 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:36,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:36,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1000719249, now seen corresponding path program 1 times [2025-03-08 23:09:36,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:36,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372999520] [2025-03-08 23:09:36,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:36,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:36,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:09:36,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:09:36,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:36,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:37,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:37,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:37,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372999520] [2025-03-08 23:09:37,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372999520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:37,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232804720] [2025-03-08 23:09:37,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:37,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:37,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:37,062 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:09:37,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 23:09:37,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:09:37,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:09:37,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:37,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:37,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 23:09:37,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:37,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:09:37,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:09:37,275 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-03-08 23:09:37,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:37,317 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-08 23:09:37,324 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:09:37,324 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-08 23:09:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-08 23:09:37,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:37,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232804720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:37,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:09:37,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2025-03-08 23:09:37,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601569345] [2025-03-08 23:09:37,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:37,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 23:09:37,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:37,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 23:09:37,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=1, NotChecked=32, Total=342 [2025-03-08 23:09:37,484 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 17 states, 16 states have (on average 2.5) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 23:09:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:37,911 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2025-03-08 23:09:37,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:09:37,911 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2025-03-08 23:09:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:37,912 INFO L225 Difference]: With dead ends: 132 [2025-03-08 23:09:37,913 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 23:09:37,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=319, Unknown=1, NotChecked=36, Total=420 [2025-03-08 23:09:37,913 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 2 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:37,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 685 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 651 Invalid, 0 Unknown, 139 Unchecked, 0.3s Time] [2025-03-08 23:09:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 23:09:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2025-03-08 23:09:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 75 states have (on average 1.8) internal successors, (135), 125 states have internal predecessors, (135), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 23:09:37,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2025-03-08 23:09:37,922 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 25 [2025-03-08 23:09:37,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:37,923 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2025-03-08 23:09:37,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 23:09:37,923 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2025-03-08 23:09:37,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 23:09:37,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:37,923 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:37,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 23:09:38,124 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,SelfDestructingSolverStorable6 [2025-03-08 23:09:38,124 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:38,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:38,125 INFO L85 PathProgramCache]: Analyzing trace with hash 932509267, now seen corresponding path program 2 times [2025-03-08 23:09:38,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:38,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486685738] [2025-03-08 23:09:38,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:09:38,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:38,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 23:09:38,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:09:38,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:09:38,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 23:09:38,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:38,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486685738] [2025-03-08 23:09:38,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486685738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:38,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600091253] [2025-03-08 23:09:38,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:09:38,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:38,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:38,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:09:38,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 23:09:38,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 23:09:38,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:09:38,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:09:38,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:38,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 23:09:38,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 23:09:38,354 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:09:38,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600091253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:38,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:09:38,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-08 23:09:38,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116664861] [2025-03-08 23:09:38,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:38,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:09:38,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:38,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:09:38,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:09:38,355 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:09:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:38,365 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2025-03-08 23:09:38,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:09:38,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-08 23:09:38,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:38,366 INFO L225 Difference]: With dead ends: 124 [2025-03-08 23:09:38,366 INFO L226 Difference]: Without dead ends: 124 [2025-03-08 23:09:38,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:09:38,367 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:38,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-08 23:09:38,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-08 23:09:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 70 states have (on average 1.8142857142857143) internal successors, (127), 119 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:09:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2025-03-08 23:09:38,376 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 37 [2025-03-08 23:09:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:38,376 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2025-03-08 23:09:38,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:09:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2025-03-08 23:09:38,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 23:09:38,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:38,377 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:38,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 23:09:38,578 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-08 23:09:38,578 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:38,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:38,578 INFO L85 PathProgramCache]: Analyzing trace with hash 907860802, now seen corresponding path program 1 times [2025-03-08 23:09:38,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:38,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370995891] [2025-03-08 23:09:38,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:38,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:38,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:09:38,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:09:38,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:38,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:09:38,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:38,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370995891] [2025-03-08 23:09:38,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370995891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:38,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87936904] [2025-03-08 23:09:38,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:38,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:38,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:38,920 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:09:38,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 23:09:38,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:09:39,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:09:39,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:39,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:39,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 23:09:39,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:39,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:09:39,039 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-03-08 23:09:39,058 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 23:09:39,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-08 23:09:39,095 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 23:09:39,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-08 23:09:39,136 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 23:09:39,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-08 23:09:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 23:09:39,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:09:39,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87936904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:39,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:09:39,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 13 [2025-03-08 23:09:39,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447684016] [2025-03-08 23:09:39,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:39,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:09:39,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:39,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:09:39,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=123, Unknown=1, NotChecked=22, Total=182 [2025-03-08 23:09:39,150 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:09:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:39,258 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2025-03-08 23:09:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:09:39,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-08 23:09:39,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:39,259 INFO L225 Difference]: With dead ends: 134 [2025-03-08 23:09:39,259 INFO L226 Difference]: Without dead ends: 134 [2025-03-08 23:09:39,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=145, Unknown=1, NotChecked=24, Total=210 [2025-03-08 23:09:39,260 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 80 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:39,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 207 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 185 Invalid, 0 Unknown, 164 Unchecked, 0.1s Time] [2025-03-08 23:09:39,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-08 23:09:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2025-03-08 23:09:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 70 states have (on average 1.7) internal successors, (119), 111 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:09:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2025-03-08 23:09:39,267 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 37 [2025-03-08 23:09:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:39,269 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2025-03-08 23:09:39,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:09:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2025-03-08 23:09:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 23:09:39,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:39,270 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:39,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 23:09:39,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:39,471 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:39,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:39,472 INFO L85 PathProgramCache]: Analyzing trace with hash 907860803, now seen corresponding path program 1 times [2025-03-08 23:09:39,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:39,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549685107] [2025-03-08 23:09:39,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:39,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:39,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:09:39,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:09:39,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:39,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:39,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:39,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549685107] [2025-03-08 23:09:39,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549685107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:39,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789291848] [2025-03-08 23:09:39,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:39,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:39,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:39,912 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:09:39,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 23:09:39,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:09:40,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:09:40,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:40,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:40,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 23:09:40,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:40,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:09:40,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:09:40,043 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-03-08 23:09:40,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:40,079 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-08 23:09:40,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:09:40,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:40,137 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-08 23:09:40,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:09:40,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:40,232 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-08 23:09:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 23:09:40,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:09:40,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789291848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:40,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:09:40,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 15 [2025-03-08 23:09:40,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917048457] [2025-03-08 23:09:40,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:40,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:09:40,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:40,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:09:40,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2025-03-08 23:09:40,241 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:09:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:40,370 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2025-03-08 23:09:40,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:09:40,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-08 23:09:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:40,370 INFO L225 Difference]: With dead ends: 111 [2025-03-08 23:09:40,371 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 23:09:40,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2025-03-08 23:09:40,371 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 22 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:40,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 333 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 193 Invalid, 0 Unknown, 148 Unchecked, 0.1s Time] [2025-03-08 23:09:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 23:09:40,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-08 23:09:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 70 states have (on average 1.6285714285714286) internal successors, (114), 106 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:09:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2025-03-08 23:09:40,374 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 37 [2025-03-08 23:09:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:40,374 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2025-03-08 23:09:40,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:09:40,375 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2025-03-08 23:09:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 23:09:40,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:40,375 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:40,381 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-08 23:09:40,575 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,SelfDestructingSolverStorable9 [2025-03-08 23:09:40,576 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:40,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:40,576 INFO L85 PathProgramCache]: Analyzing trace with hash 575871615, now seen corresponding path program 1 times [2025-03-08 23:09:40,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:40,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039646547] [2025-03-08 23:09:40,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:40,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:40,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 23:09:40,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 23:09:40,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:40,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 23:09:40,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:40,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039646547] [2025-03-08 23:09:40,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039646547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:40,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:40,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:09:40,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039380784] [2025-03-08 23:09:40,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:40,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:09:40,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:40,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:09:40,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:09:40,649 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:09:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:40,754 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2025-03-08 23:09:40,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:09:40,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-03-08 23:09:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:40,755 INFO L225 Difference]: With dead ends: 109 [2025-03-08 23:09:40,755 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 23:09:40,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:09:40,756 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 19 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:40,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 344 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 23:09:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-08 23:09:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 70 states have (on average 1.6) internal successors, (112), 104 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:09:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2025-03-08 23:09:40,758 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 39 [2025-03-08 23:09:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:40,758 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2025-03-08 23:09:40,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:09:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2025-03-08 23:09:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 23:09:40,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:40,759 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:40,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 23:09:40,759 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:40,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash 575871616, now seen corresponding path program 1 times [2025-03-08 23:09:40,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:40,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869177897] [2025-03-08 23:09:40,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:40,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:40,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 23:09:40,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 23:09:40,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:40,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:40,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:40,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869177897] [2025-03-08 23:09:40,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869177897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:40,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774385869] [2025-03-08 23:09:40,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:40,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:40,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:40,904 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:09:40,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 23:09:40,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 23:09:41,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 23:09:41,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:41,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:41,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 23:09:41,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:41,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:09:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 23:09:41,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:09:41,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774385869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:41,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:09:41,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-03-08 23:09:41,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943223622] [2025-03-08 23:09:41,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:41,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:09:41,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:41,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:09:41,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-08 23:09:41,093 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:09:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:41,200 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2025-03-08 23:09:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:09:41,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-03-08 23:09:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:41,201 INFO L225 Difference]: With dead ends: 107 [2025-03-08 23:09:41,201 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 23:09:41,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-08 23:09:41,202 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 18 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:41,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 356 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:41,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 23:09:41,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-08 23:09:41,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 102 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:09:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2025-03-08 23:09:41,204 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 39 [2025-03-08 23:09:41,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:41,204 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2025-03-08 23:09:41,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:09:41,204 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2025-03-08 23:09:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 23:09:41,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:41,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:41,215 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-08 23:09:41,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:41,409 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:41,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:41,409 INFO L85 PathProgramCache]: Analyzing trace with hash -637295365, now seen corresponding path program 1 times [2025-03-08 23:09:41,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:41,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401651844] [2025-03-08 23:09:41,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:41,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:41,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:09:41,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:09:41,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:41,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:41,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:41,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401651844] [2025-03-08 23:09:41,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401651844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:41,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814262183] [2025-03-08 23:09:41,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:41,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:41,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:41,632 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-08 23:09:41,633 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-08 23:09:41,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:09:41,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:09:41,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:41,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:41,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 23:09:41,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:41,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:09:42,009 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 9 treesize of output 3 [2025-03-08 23:09:42,015 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-03-08 23:09:42,045 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-08 23:09:42,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-03-08 23:09:42,058 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-08 23:09:42,060 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-08 23:09:42,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:42,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814262183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:42,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:09:42,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2025-03-08 23:09:42,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089136432] [2025-03-08 23:09:42,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:42,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 23:09:42,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:42,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 23:09:42,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=406, Unknown=1, NotChecked=40, Total=506 [2025-03-08 23:09:42,107 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:09:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:42,502 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2025-03-08 23:09:42,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 23:09:42,502 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-03-08 23:09:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:42,503 INFO L225 Difference]: With dead ends: 106 [2025-03-08 23:09:42,503 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 23:09:42,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=614, Unknown=1, NotChecked=50, Total=756 [2025-03-08 23:09:42,504 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 101 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:42,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 724 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 745 Invalid, 0 Unknown, 110 Unchecked, 0.3s Time] [2025-03-08 23:09:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 23:09:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-08 23:09:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.5492957746478873) internal successors, (110), 101 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:09:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2025-03-08 23:09:42,507 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 41 [2025-03-08 23:09:42,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:42,508 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2025-03-08 23:09:42,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:09:42,508 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2025-03-08 23:09:42,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 23:09:42,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:42,510 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:42,517 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-08 23:09:42,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:42,710 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:42,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:42,711 INFO L85 PathProgramCache]: Analyzing trace with hash -637295364, now seen corresponding path program 1 times [2025-03-08 23:09:42,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:42,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319118391] [2025-03-08 23:09:42,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:42,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:42,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:09:42,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:09:42,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:42,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:43,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:43,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319118391] [2025-03-08 23:09:43,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319118391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:43,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107345185] [2025-03-08 23:09:43,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:43,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:43,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:43,057 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-08 23:09:43,058 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-08 23:09:43,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:09:43,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:09:43,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:43,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:43,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 23:09:43,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:43,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:09:43,455 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 9 treesize of output 3 [2025-03-08 23:09:43,551 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 23:09:43,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2025-03-08 23:09:43,597 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-08 23:09:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:43,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:43,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107345185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:43,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:09:43,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2025-03-08 23:09:43,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005186794] [2025-03-08 23:09:43,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:43,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 23:09:43,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:43,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 23:09:43,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2025-03-08 23:09:43,814 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 26 states, 25 states have (on average 2.52) internal successors, (63), 22 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:09:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:44,589 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2025-03-08 23:09:44,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 23:09:44,589 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.52) internal successors, (63), 22 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-03-08 23:09:44,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:44,590 INFO L225 Difference]: With dead ends: 117 [2025-03-08 23:09:44,590 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 23:09:44,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=1563, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 23:09:44,591 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 116 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:44,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1255 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 23:09:44,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 23:09:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-08 23:09:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 111 states have internal predecessors, (120), 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-08 23:09:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2025-03-08 23:09:44,594 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 41 [2025-03-08 23:09:44,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:44,594 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2025-03-08 23:09:44,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.52) internal successors, (63), 22 states have internal predecessors, (63), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:09:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2025-03-08 23:09:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 23:09:44,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:44,595 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:44,602 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-08 23:09:44,799 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,SelfDestructingSolverStorable13 [2025-03-08 23:09:44,799 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:44,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:44,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1691957814, now seen corresponding path program 1 times [2025-03-08 23:09:44,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:44,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684221179] [2025-03-08 23:09:44,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:44,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:44,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 23:09:44,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 23:09:44,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:44,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 23:09:44,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:44,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684221179] [2025-03-08 23:09:44,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684221179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:44,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:44,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:09:44,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760611596] [2025-03-08 23:09:44,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:44,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:09:44,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:44,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:09:44,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:09:44,873 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:09:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:44,937 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2025-03-08 23:09:44,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:09:44,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2025-03-08 23:09:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:44,938 INFO L225 Difference]: With dead ends: 134 [2025-03-08 23:09:44,938 INFO L226 Difference]: Without dead ends: 134 [2025-03-08 23:09:44,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-08 23:09:44,938 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 104 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:44,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 160 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-08 23:09:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2025-03-08 23:09:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 110 states have internal predecessors, (119), 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-08 23:09:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2025-03-08 23:09:44,943 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 42 [2025-03-08 23:09:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:44,944 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2025-03-08 23:09:44,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:09:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2025-03-08 23:09:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 23:09:44,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:44,946 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:44,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 23:09:44,946 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:44,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:44,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1691957815, now seen corresponding path program 1 times [2025-03-08 23:09:44,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:44,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998074765] [2025-03-08 23:09:44,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:44,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:44,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 23:09:44,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 23:09:44,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:44,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:45,098 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:45,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:45,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998074765] [2025-03-08 23:09:45,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998074765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:45,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530010038] [2025-03-08 23:09:45,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:45,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:45,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:45,101 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-08 23:09:45,103 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-08 23:09:45,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 23:09:45,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 23:09:45,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:45,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:45,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 23:09:45,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:45,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:09:45,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:09:45,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:09:45,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:09:45,277 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-03-08 23:09:45,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:45,304 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-08 23:09:45,333 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:09:45,333 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-08 23:09:45,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:09:45,378 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-03-08 23:09:45,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:45,400 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-08 23:09:45,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:09:45,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:45,461 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-08 23:09:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 12 not checked. [2025-03-08 23:09:45,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:45,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530010038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:45,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:09:45,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2025-03-08 23:09:45,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185378057] [2025-03-08 23:09:45,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:45,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 23:09:45,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:45,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 23:09:45,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=233, Unknown=2, NotChecked=62, Total=342 [2025-03-08 23:09:45,572 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 17 states, 16 states have (on average 3.6875) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:09:45,589 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|)))) is different from true [2025-03-08 23:09:45,591 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_#res#1.base| 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|)))) is different from true [2025-03-08 23:09:45,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:45,803 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2025-03-08 23:09:45,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 23:09:45,803 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.6875) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2025-03-08 23:09:45,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:45,804 INFO L225 Difference]: With dead ends: 110 [2025-03-08 23:09:45,804 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 23:09:45,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=467, Unknown=4, NotChecked=188, Total=756 [2025-03-08 23:09:45,805 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 67 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 301 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:45,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 696 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 387 Invalid, 0 Unknown, 301 Unchecked, 0.2s Time] [2025-03-08 23:09:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 23:09:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-08 23:09:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 104 states have internal predecessors, (112), 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-08 23:09:45,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2025-03-08 23:09:45,807 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 42 [2025-03-08 23:09:45,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:45,807 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2025-03-08 23:09:45,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.6875) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:09:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2025-03-08 23:09:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 23:09:45,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:45,808 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:45,815 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-08 23:09:46,008 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,SelfDestructingSolverStorable15 [2025-03-08 23:09:46,009 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:46,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:46,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2070978618, now seen corresponding path program 1 times [2025-03-08 23:09:46,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:46,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629737126] [2025-03-08 23:09:46,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:46,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:46,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:09:46,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:09:46,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:46,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:46,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:46,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629737126] [2025-03-08 23:09:46,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629737126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:46,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569723532] [2025-03-08 23:09:46,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:46,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:46,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:46,682 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-08 23:09:46,684 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-08 23:09:46,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:09:46,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:09:46,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:46,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:46,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-03-08 23:09:46,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:46,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:09:47,028 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:09:47,028 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-08 23:09:47,089 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 11 treesize of output 7 [2025-03-08 23:09:47,173 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:09:47,174 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-08 23:09:47,295 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 30 treesize of output 14 [2025-03-08 23:09:47,298 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 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 23:09:47,437 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from true [2025-03-08 23:09:47,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:47,461 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 38 treesize of output 27 [2025-03-08 23:09:47,484 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2025-03-08 23:09:47,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2025-03-08 23:09:47,616 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 66 treesize of output 38 [2025-03-08 23:09:47,751 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 33 treesize of output 17 [2025-03-08 23:09:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-08 23:09:47,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:47,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569723532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:47,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:09:47,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 46 [2025-03-08 23:09:47,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629356653] [2025-03-08 23:09:47,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:47,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-08 23:09:47,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:47,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-08 23:09:47,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2017, Unknown=1, NotChecked=90, Total=2256 [2025-03-08 23:09:47,925 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 47 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 40 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:09:48,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:48,924 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2025-03-08 23:09:48,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 23:09:48,925 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 40 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2025-03-08 23:09:48,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:48,925 INFO L225 Difference]: With dead ends: 112 [2025-03-08 23:09:48,925 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 23:09:48,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=284, Invalid=3379, Unknown=1, NotChecked=118, Total=3782 [2025-03-08 23:09:48,926 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 120 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 1759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:48,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1571 Invalid, 1759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1627 Invalid, 0 Unknown, 118 Unchecked, 0.6s Time] [2025-03-08 23:09:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 23:09:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-08 23:09:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 106 states have internal predecessors, (115), 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-08 23:09:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2025-03-08 23:09:48,929 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 46 [2025-03-08 23:09:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:48,929 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2025-03-08 23:09:48,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 40 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:09:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2025-03-08 23:09:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 23:09:48,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:48,930 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:48,937 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-08 23:09:49,130 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,SelfDestructingSolverStorable16 [2025-03-08 23:09:49,130 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:49,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:49,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2070978619, now seen corresponding path program 1 times [2025-03-08 23:09:49,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:49,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96553364] [2025-03-08 23:09:49,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:49,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:49,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:09:49,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:09:49,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:49,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:50,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:50,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96553364] [2025-03-08 23:09:50,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96553364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:50,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24679773] [2025-03-08 23:09:50,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:50,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:50,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:50,026 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-08 23:09:50,028 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-08 23:09:50,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:09:50,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:09:50,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:50,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:50,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-03-08 23:09:50,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:50,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:09:50,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:09:50,478 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:09:50,478 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-08 23:09:50,482 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-08 23:09:50,562 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 11 treesize of output 7 [2025-03-08 23:09:50,566 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 11 treesize of output 7 [2025-03-08 23:09:50,688 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:09:50,688 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2025-03-08 23:09:50,695 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 24 treesize of output 11 [2025-03-08 23:09:50,860 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 43 treesize of output 19 [2025-03-08 23:09:50,863 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 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 23:09:50,866 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 11 treesize of output 3 [2025-03-08 23:09:50,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2025-03-08 23:09:51,029 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))) is different from true [2025-03-08 23:09:51,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:51,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2025-03-08 23:09:51,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:51,066 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 22 treesize of output 17 [2025-03-08 23:09:51,079 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 23:09:51,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 23:09:51,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-08 23:09:51,163 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 48 treesize of output 28 [2025-03-08 23:09:51,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 23:09:51,336 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 7 treesize of output 3 [2025-03-08 23:09:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-08 23:09:51,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:51,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24679773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:51,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:09:51,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 48 [2025-03-08 23:09:51,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817353317] [2025-03-08 23:09:51,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:51,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-08 23:09:51,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:51,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-08 23:09:51,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2703, Unknown=1, NotChecked=104, Total=2970 [2025-03-08 23:09:51,637 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 49 states, 45 states have (on average 1.711111111111111) internal successors, (77), 42 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:09:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:53,255 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2025-03-08 23:09:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 23:09:53,256 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.711111111111111) internal successors, (77), 42 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2025-03-08 23:09:53,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:53,256 INFO L225 Difference]: With dead ends: 116 [2025-03-08 23:09:53,256 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 23:09:53,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=312, Invalid=4803, Unknown=1, NotChecked=140, Total=5256 [2025-03-08 23:09:53,258 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 124 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 2360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:53,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1817 Invalid, 2360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2227 Invalid, 0 Unknown, 122 Unchecked, 0.9s Time] [2025-03-08 23:09:53,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 23:09:53,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-08 23:09:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 109 states have internal predecessors, (118), 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-08 23:09:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2025-03-08 23:09:53,260 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 46 [2025-03-08 23:09:53,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:53,261 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2025-03-08 23:09:53,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.711111111111111) internal successors, (77), 42 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:09:53,261 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2025-03-08 23:09:53,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 23:09:53,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:53,261 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:53,268 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-08 23:09:53,462 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,SelfDestructingSolverStorable17 [2025-03-08 23:09:53,462 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:53,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:53,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1721117605, now seen corresponding path program 2 times [2025-03-08 23:09:53,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:53,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481787184] [2025-03-08 23:09:53,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:09:53,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:53,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-08 23:09:53,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 23:09:53,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:09:53,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:54,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:54,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481787184] [2025-03-08 23:09:54,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481787184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:54,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18346063] [2025-03-08 23:09:54,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:09:54,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:54,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:54,262 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-08 23:09:54,262 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-08 23:09:54,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-08 23:09:54,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 23:09:54,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:09:54,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:54,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 135 conjuncts are in the unsatisfiable core [2025-03-08 23:09:54,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:54,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:09:54,635 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:09:54,636 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-08 23:09:54,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 23:09:54,712 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 11 treesize of output 7 [2025-03-08 23:09:54,802 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-08 23:09:54,802 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2025-03-08 23:09:54,804 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 22 [2025-03-08 23:09:54,956 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 23:09:54,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2025-03-08 23:09:54,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-08 23:09:54,969 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 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 23:09:55,100 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_7|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-03-08 23:09:55,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:55,129 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-08 23:09:55,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 55 [2025-03-08 23:09:55,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:55,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:55,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-03-08 23:09:55,149 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 23:09:55,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 23:09:55,552 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:09:55,557 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2025-03-08 23:09:55,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 35 [2025-03-08 23:09:55,628 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 45 treesize of output 25 [2025-03-08 23:09:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-08 23:09:55,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:56,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18346063] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:56,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:09:56,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2025-03-08 23:09:56,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231761306] [2025-03-08 23:09:56,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:56,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-08 23:09:56,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:56,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-08 23:09:56,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3605, Unknown=1, NotChecked=120, Total=3906 [2025-03-08 23:09:56,174 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 54 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 47 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:09:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:58,267 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2025-03-08 23:09:58,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 23:09:58,267 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 47 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2025-03-08 23:09:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:58,268 INFO L225 Difference]: With dead ends: 105 [2025-03-08 23:09:58,268 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 23:09:58,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=405, Invalid=6569, Unknown=2, NotChecked=164, Total=7140 [2025-03-08 23:09:58,269 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 82 mSDsluCounter, 2134 mSDsCounter, 0 mSdLazyCounter, 1979 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:58,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 2211 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1979 Invalid, 0 Unknown, 109 Unchecked, 0.8s Time] [2025-03-08 23:09:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 23:09:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-03-08 23:09:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 98 states have internal predecessors, (105), 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-08 23:09:58,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2025-03-08 23:09:58,271 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 51 [2025-03-08 23:09:58,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:58,271 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2025-03-08 23:09:58,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 47 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:09:58,271 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2025-03-08 23:09:58,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 23:09:58,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:58,272 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:58,280 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-08 23:09:58,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:58,472 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:58,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:58,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1835435372, now seen corresponding path program 1 times [2025-03-08 23:09:58,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:58,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140097881] [2025-03-08 23:09:58,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:58,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:58,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 23:09:58,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 23:09:58,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:58,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 23:09:58,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:58,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140097881] [2025-03-08 23:09:58,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140097881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:58,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:58,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 23:09:58,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21507450] [2025-03-08 23:09:58,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:58,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:09:58,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:58,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:09:58,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:09:58,628 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:09:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:58,754 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2025-03-08 23:09:58,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 23:09:58,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2025-03-08 23:09:58,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:58,755 INFO L225 Difference]: With dead ends: 109 [2025-03-08 23:09:58,755 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 23:09:58,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-08 23:09:58,755 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 63 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:58,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 399 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:58,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 23:09:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2025-03-08 23:09:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.358974358974359) internal successors, (106), 98 states have internal predecessors, (106), 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-08 23:09:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2025-03-08 23:09:58,757 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 53 [2025-03-08 23:09:58,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:58,757 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2025-03-08 23:09:58,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:09:58,757 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2025-03-08 23:09:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 23:09:58,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:58,759 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:58,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 23:09:58,759 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:09:58,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:58,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1835435373, now seen corresponding path program 1 times [2025-03-08 23:09:58,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:58,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242150309] [2025-03-08 23:09:58,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:58,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:58,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 23:09:58,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 23:09:58,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:58,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:59,018 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:59,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:59,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242150309] [2025-03-08 23:09:59,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242150309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:59,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461971988] [2025-03-08 23:09:59,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:59,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:59,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:59,020 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-08 23:09:59,022 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-08 23:09:59,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 23:09:59,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 23:09:59,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:59,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:59,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-08 23:09:59,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:59,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:09:59,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:09:59,337 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 9 treesize of output 3 [2025-03-08 23:09:59,340 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 9 treesize of output 3 [2025-03-08 23:09:59,452 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 23:09:59,452 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 15 treesize of output 15 [2025-03-08 23:09:59,455 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 18 treesize of output 13 [2025-03-08 23:09:59,563 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-08 23:09:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:59,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:59,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461971988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:59,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:09:59,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2025-03-08 23:09:59,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326037492] [2025-03-08 23:09:59,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:59,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 23:09:59,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:59,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 23:09:59,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1093, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 23:09:59,785 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 31 states, 29 states have (on average 2.689655172413793) internal successors, (78), 27 states have internal predecessors, (78), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 23:10:00,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:00,575 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2025-03-08 23:10:00,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 23:10:00,575 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.689655172413793) internal successors, (78), 27 states have internal predecessors, (78), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2025-03-08 23:10:00,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:00,576 INFO L225 Difference]: With dead ends: 121 [2025-03-08 23:10:00,576 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 23:10:00,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=2056, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 23:10:00,576 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 149 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:00,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1319 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 23:10:00,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 23:10:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2025-03-08 23:10:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 81 states have (on average 1.345679012345679) internal successors, (109), 101 states have internal predecessors, (109), 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-08 23:10:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2025-03-08 23:10:00,579 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 53 [2025-03-08 23:10:00,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:00,579 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2025-03-08 23:10:00,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.689655172413793) internal successors, (78), 27 states have internal predecessors, (78), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 23:10:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2025-03-08 23:10:00,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 23:10:00,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:00,580 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:00,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 23:10:00,780 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,SelfDestructingSolverStorable20 [2025-03-08 23:10:00,780 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:10:00,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:00,781 INFO L85 PathProgramCache]: Analyzing trace with hash 226561555, now seen corresponding path program 1 times [2025-03-08 23:10:00,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:00,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624617194] [2025-03-08 23:10:00,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:00,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:00,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 23:10:00,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 23:10:00,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:00,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 23:10:00,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:00,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624617194] [2025-03-08 23:10:00,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624617194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:00,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:10:00,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:10:00,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931726220] [2025-03-08 23:10:00,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:00,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:10:00,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:00,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:10:00,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:10:00,849 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:10:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:00,942 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2025-03-08 23:10:00,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:10:00,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2025-03-08 23:10:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:00,943 INFO L225 Difference]: With dead ends: 124 [2025-03-08 23:10:00,943 INFO L226 Difference]: Without dead ends: 124 [2025-03-08 23:10:00,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-08 23:10:00,944 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 64 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:00,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 444 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:10:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-08 23:10:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2025-03-08 23:10:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 101 states have internal predecessors, (110), 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-08 23:10:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2025-03-08 23:10:00,946 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 56 [2025-03-08 23:10:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:00,946 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2025-03-08 23:10:00,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:10:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2025-03-08 23:10:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 23:10:00,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:00,947 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:00,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 23:10:00,947 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:10:00,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:00,948 INFO L85 PathProgramCache]: Analyzing trace with hash 226561556, now seen corresponding path program 1 times [2025-03-08 23:10:00,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:00,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552272692] [2025-03-08 23:10:00,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:00,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:00,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 23:10:00,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 23:10:00,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:00,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:10:01,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:01,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552272692] [2025-03-08 23:10:01,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552272692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:01,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697951603] [2025-03-08 23:10:01,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:01,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:01,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:01,505 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-08 23:10:01,506 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-08 23:10:01,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 23:10:01,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 23:10:01,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:01,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:01,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 23:10:01,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:01,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:10:01,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:10:01,843 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 9 treesize of output 3 [2025-03-08 23:10:01,845 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 9 treesize of output 3 [2025-03-08 23:10:01,877 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_9| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_17| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_9|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_17|) 0))) is different from true [2025-03-08 23:10:01,919 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 23:10:01,919 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 15 treesize of output 15 [2025-03-08 23:10:01,922 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 18 treesize of output 13 [2025-03-08 23:10:02,007 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 23:10:02,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 23:10:02,058 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 24 treesize of output 12 [2025-03-08 23:10:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-08 23:10:02,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:02,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697951603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:02,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:02,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 35 [2025-03-08 23:10:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889650828] [2025-03-08 23:10:02,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:02,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 23:10:02,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:02,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 23:10:02,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1356, Unknown=1, NotChecked=74, Total=1560 [2025-03-08 23:10:02,260 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 36 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 32 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 23:10:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:02,905 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2025-03-08 23:10:02,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 23:10:02,906 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 32 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 56 [2025-03-08 23:10:02,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:02,906 INFO L225 Difference]: With dead ends: 121 [2025-03-08 23:10:02,906 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 23:10:02,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=226, Invalid=2129, Unknown=1, NotChecked=94, Total=2450 [2025-03-08 23:10:02,907 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 175 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:02,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1024 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1213 Invalid, 0 Unknown, 123 Unchecked, 0.4s Time] [2025-03-08 23:10:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 23:10:02,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2025-03-08 23:10:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 103 states have internal predecessors, (112), 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-08 23:10:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2025-03-08 23:10:02,909 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 56 [2025-03-08 23:10:02,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:02,910 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2025-03-08 23:10:02,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 32 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 23:10:02,910 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2025-03-08 23:10:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 23:10:02,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:02,910 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:02,921 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-08 23:10:03,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:03,111 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:10:03,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1317701630, now seen corresponding path program 1 times [2025-03-08 23:10:03,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:03,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33136595] [2025-03-08 23:10:03,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:03,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:03,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 23:10:03,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 23:10:03,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:03,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:10:03,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:03,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33136595] [2025-03-08 23:10:03,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33136595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:03,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041546206] [2025-03-08 23:10:03,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:03,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:03,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:03,615 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-08 23:10:03,616 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-08 23:10:03,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 23:10:03,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 23:10:03,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:03,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:03,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-03-08 23:10:03,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:03,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:10:03,925 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 23:10:03,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 23:10:03,993 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 11 treesize of output 7 [2025-03-08 23:10:04,064 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:04,064 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-08 23:10:04,144 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 30 treesize of output 14 [2025-03-08 23:10:04,146 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 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 23:10:04,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:04,300 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 38 treesize of output 27 [2025-03-08 23:10:04,320 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2025-03-08 23:10:04,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2025-03-08 23:10:04,803 INFO L349 Elim1Store]: treesize reduction 77, result has 12.5 percent of original size [2025-03-08 23:10:04,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 51 [2025-03-08 23:10:04,924 INFO L349 Elim1Store]: treesize reduction 76, result has 26.2 percent of original size [2025-03-08 23:10:04,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 103 [2025-03-08 23:10:04,932 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 57 treesize of output 33 [2025-03-08 23:10:05,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:05,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 170 treesize of output 142 [2025-03-08 23:10:05,269 INFO L349 Elim1Store]: treesize reduction 12, result has 83.6 percent of original size [2025-03-08 23:10:05,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 127 [2025-03-08 23:10:06,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:06,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 76 [2025-03-08 23:10:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:06,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:06,927 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2160 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_31| Int) (v_ArrVal_2166 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_31| 1)) (.cse3 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_31| v_ArrVal_2166) .cse2)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (< .cse0 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_31|) 0)) (= (select .cse1 (select (select (store (store |c_#memory_$Pointer$#2.base| .cse2 (store .cse3 .cse0 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_31|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_31| v_ArrVal_2160) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1) (not (= (select .cse1 .cse2) 1)) (not (= (select .cse3 .cse0) .cse2)))))) is different from false [2025-03-08 23:10:06,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041546206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:06,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:06,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 32] total 51 [2025-03-08 23:10:06,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951095418] [2025-03-08 23:10:06,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:06,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-08 23:10:06,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:06,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-08 23:10:06,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=3381, Unknown=9, NotChecked=118, Total=3782 [2025-03-08 23:10:06,930 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 52 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 45 states have internal predecessors, (97), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:10:08,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:08,410 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2025-03-08 23:10:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 23:10:08,410 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 45 states have internal predecessors, (97), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2025-03-08 23:10:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:08,415 INFO L225 Difference]: With dead ends: 130 [2025-03-08 23:10:08,415 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 23:10:08,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1474 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=496, Invalid=5505, Unknown=9, NotChecked=152, Total=6162 [2025-03-08 23:10:08,416 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 156 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:08,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1265 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1819 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 23:10:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 23:10:08,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2025-03-08 23:10:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 105 states have internal predecessors, (114), 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-08 23:10:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2025-03-08 23:10:08,418 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 58 [2025-03-08 23:10:08,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:08,419 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2025-03-08 23:10:08,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 45 states have internal predecessors, (97), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:10:08,419 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2025-03-08 23:10:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 23:10:08,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:08,419 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:08,426 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-08 23:10:08,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:08,620 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:10:08,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:08,620 INFO L85 PathProgramCache]: Analyzing trace with hash -31161692, now seen corresponding path program 1 times [2025-03-08 23:10:08,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:08,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019847581] [2025-03-08 23:10:08,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:08,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:08,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 23:10:08,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 23:10:08,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:08,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:11,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019847581] [2025-03-08 23:10:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019847581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939759570] [2025-03-08 23:10:11,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:11,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:11,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:11,332 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-08 23:10:11,334 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-08 23:10:11,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 23:10:11,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 23:10:11,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:11,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:11,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-03-08 23:10:11,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:11,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:10:11,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:10:11,831 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 23:10:11,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 23:10:11,839 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-08 23:10:11,945 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 11 treesize of output 7 [2025-03-08 23:10:11,952 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 11 treesize of output 7 [2025-03-08 23:10:12,078 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:12,079 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2025-03-08 23:10:12,084 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 24 treesize of output 11 [2025-03-08 23:10:12,267 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 43 treesize of output 19 [2025-03-08 23:10:12,270 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 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 23:10:12,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2025-03-08 23:10:12,275 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 11 treesize of output 3 [2025-03-08 23:10:12,618 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 23:10:12,619 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 20 treesize of output 23 [2025-03-08 23:10:12,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:12,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2025-03-08 23:10:12,641 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 23:10:12,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 23:10:12,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-08 23:10:13,038 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2025-03-08 23:10:13,038 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 1 case distinctions, treesize of input 53 treesize of output 48 [2025-03-08 23:10:13,049 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2025-03-08 23:10:13,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2025-03-08 23:10:13,258 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-08 23:10:13,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 79 [2025-03-08 23:10:13,272 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-08 23:10:13,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 106 [2025-03-08 23:10:13,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:10:13,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:10:13,716 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 192 treesize of output 124 [2025-03-08 23:10:14,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:14,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 89 [2025-03-08 23:10:14,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 23:10:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:10:14,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:14,800 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2323 (Array Int Int)) (v_ArrVal_2322 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2322) .cse0) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2323) .cse0) .cse1)))) (forall ((v_ArrVal_2322 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2322) .cse0) .cse1))))) is different from false [2025-03-08 23:10:15,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939759570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:15,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:15,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 28] total 68 [2025-03-08 23:10:15,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700409121] [2025-03-08 23:10:15,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:15,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-03-08 23:10:15,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:15,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-03-08 23:10:15,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=5591, Unknown=53, NotChecked=150, Total=6006 [2025-03-08 23:10:15,825 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 69 states, 66 states have (on average 1.6666666666666667) internal successors, (110), 60 states have internal predecessors, (110), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 23:10:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:20,869 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2025-03-08 23:10:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-08 23:10:20,869 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 66 states have (on average 1.6666666666666667) internal successors, (110), 60 states have internal predecessors, (110), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 63 [2025-03-08 23:10:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:20,870 INFO L225 Difference]: With dead ends: 144 [2025-03-08 23:10:20,870 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 23:10:20,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=633, Invalid=11090, Unknown=53, NotChecked=214, Total=11990 [2025-03-08 23:10:20,872 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 361 mSDsluCounter, 2542 mSDsCounter, 0 mSdLazyCounter, 4103 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 2603 SdHoareTripleChecker+Invalid, 4122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:20,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 2603 Invalid, 4122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4103 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 23:10:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 23:10:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 114. [2025-03-08 23:10:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 108 states have internal predecessors, (117), 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-08 23:10:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2025-03-08 23:10:20,875 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 63 [2025-03-08 23:10:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:20,875 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2025-03-08 23:10:20,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 66 states have (on average 1.6666666666666667) internal successors, (110), 60 states have internal predecessors, (110), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 23:10:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2025-03-08 23:10:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 23:10:20,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:20,875 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:20,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 23:10:21,080 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,SelfDestructingSolverStorable24 [2025-03-08 23:10:21,080 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:10:21,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:21,080 INFO L85 PathProgramCache]: Analyzing trace with hash 142154688, now seen corresponding path program 1 times [2025-03-08 23:10:21,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:21,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746428346] [2025-03-08 23:10:21,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:21,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:21,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 23:10:21,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 23:10:21,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:21,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:22,567 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:22,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:22,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746428346] [2025-03-08 23:10:22,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746428346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:22,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340939619] [2025-03-08 23:10:22,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:22,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:22,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:22,570 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-08 23:10:22,571 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-08 23:10:22,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 23:10:22,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 23:10:22,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:22,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:22,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-03-08 23:10:22,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:22,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:10:22,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 23:10:23,014 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 23:10:23,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 23:10:23,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 23:10:23,107 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 11 treesize of output 7 [2025-03-08 23:10:23,236 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:23,236 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-08 23:10:23,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2025-03-08 23:10:23,386 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 38 treesize of output 14 [2025-03-08 23:10:23,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2025-03-08 23:10:23,391 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 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 23:10:23,568 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 23:10:23,569 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 26 treesize of output 29 [2025-03-08 23:10:23,573 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 11 treesize of output 3 [2025-03-08 23:10:23,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:23,579 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 46 treesize of output 35 [2025-03-08 23:10:23,588 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-03-08 23:10:23,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2025-03-08 23:10:23,782 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-03-08 23:10:23,782 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 1 case distinctions, treesize of input 48 treesize of output 51 [2025-03-08 23:10:23,796 INFO L349 Elim1Store]: treesize reduction 41, result has 46.1 percent of original size [2025-03-08 23:10:23,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2025-03-08 23:10:23,912 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-08 23:10:23,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 104 [2025-03-08 23:10:23,915 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 124 treesize of output 119 [2025-03-08 23:10:23,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:10:24,192 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 127 treesize of output 95 [2025-03-08 23:10:24,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:10:24,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 48 [2025-03-08 23:10:24,395 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 23 treesize of output 11 [2025-03-08 23:10:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:10:24,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:26,073 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_2486 (Array Int Int)) (v_ArrVal_2485 (Array Int Int)) (v_ArrVal_2484 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_2484) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2486) .cse0) (+ .cse1 4))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2485) .cse0) .cse1) .cse0)) (not (= (store (select |c_#memory_int#2| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_2484 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) v_ArrVal_2484))))) is different from false [2025-03-08 23:10:26,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340939619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:26,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:26,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 32] total 67 [2025-03-08 23:10:26,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000112897] [2025-03-08 23:10:26,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:26,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-08 23:10:26,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:26,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-08 23:10:26,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=5799, Unknown=41, NotChecked=154, Total=6320 [2025-03-08 23:10:26,222 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 67 states, 64 states have (on average 1.71875) internal successors, (110), 58 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:10:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:28,794 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2025-03-08 23:10:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 23:10:28,794 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 64 states have (on average 1.71875) internal successors, (110), 58 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 65 [2025-03-08 23:10:28,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:28,795 INFO L225 Difference]: With dead ends: 118 [2025-03-08 23:10:28,795 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 23:10:28,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2168 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=742, Invalid=11209, Unknown=43, NotChecked=216, Total=12210 [2025-03-08 23:10:28,796 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 157 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 2261 SdHoareTripleChecker+Invalid, 2516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:28,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 2261 Invalid, 2516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 23:10:28,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 23:10:28,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2025-03-08 23:10:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.303370786516854) internal successors, (116), 108 states have internal predecessors, (116), 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-08 23:10:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2025-03-08 23:10:28,798 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 65 [2025-03-08 23:10:28,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:28,799 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2025-03-08 23:10:28,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 64 states have (on average 1.71875) internal successors, (110), 58 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:10:28,799 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2025-03-08 23:10:28,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 23:10:28,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:28,799 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:28,807 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-08 23:10:28,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 23:10:29,000 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-08 23:10:29,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:29,000 INFO L85 PathProgramCache]: Analyzing trace with hash 650650923, now seen corresponding path program 1 times [2025-03-08 23:10:29,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:29,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235968130] [2025-03-08 23:10:29,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:29,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:29,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 23:10:29,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 23:10:29,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:29,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:30,717 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:30,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:30,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235968130] [2025-03-08 23:10:30,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235968130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:30,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195049139] [2025-03-08 23:10:30,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:30,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:30,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:30,719 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-08 23:10:30,720 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-08 23:10:30,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 23:10:30,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 23:10:30,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:30,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:30,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 163 conjuncts are in the unsatisfiable core [2025-03-08 23:10:30,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:30,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:10:31,115 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 23:10:31,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 23:10:31,207 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 11 treesize of output 7 [2025-03-08 23:10:31,213 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 11 treesize of output 7 [2025-03-08 23:10:31,329 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-08 23:10:31,329 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2025-03-08 23:10:31,334 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 22 [2025-03-08 23:10:31,481 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 23:10:31,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2025-03-08 23:10:31,484 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 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 23:10:31,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-08 23:10:31,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:31,714 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-08 23:10:31,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 55 [2025-03-08 23:10:31,723 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 23:10:31,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 23:10:31,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-03-08 23:10:32,580 INFO L349 Elim1Store]: treesize reduction 52, result has 56.3 percent of original size [2025-03-08 23:10:32,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 110 [2025-03-08 23:10:32,598 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-08 23:10:32,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2025-03-08 23:10:33,681 INFO L349 Elim1Store]: treesize reduction 264, result has 59.4 percent of original size [2025-03-08 23:10:33,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 35 case distinctions, treesize of input 498 treesize of output 742 [2025-03-08 23:10:33,997 INFO L349 Elim1Store]: treesize reduction 236, result has 59.0 percent of original size [2025-03-08 23:10:33,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 434 treesize of output 728