./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_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 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:15:40,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:15:40,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:15:40,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:15:40,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:15:40,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:15:40,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:15:40,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:15:40,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:15:40,671 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:15:40,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:15:40,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:15:40,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:15:40,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:15:40,672 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:15:40,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:15:40,672 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:15:40,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:15:40,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:15:40,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:15:40,673 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:15:40,673 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:15:40,674 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:15:40,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:15:40,675 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:15:40,675 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:15:40,675 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:15:40,675 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:15:40,675 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:15:40,675 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:15:40,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:15:40,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:15:40,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:15:40,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:15:40,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:15:40,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:15:40,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:15:40,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:15:40,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:15:40,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:15:40,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:15:40,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:15:40,675 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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2025-03-17 12:15:40,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:15:40,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:15:40,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:15:40,928 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:15:40,929 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:15:40,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2025-03-17 12:15:42,122 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5edaed17a/bbb99183bc7543d9bc2037bd81740eb0/FLAG9d4ab72ef [2025-03-17 12:15:42,424 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:15:42,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2025-03-17 12:15:42,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5edaed17a/bbb99183bc7543d9bc2037bd81740eb0/FLAG9d4ab72ef [2025-03-17 12:15:42,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5edaed17a/bbb99183bc7543d9bc2037bd81740eb0 [2025-03-17 12:15:42,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:15:42,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:15:42,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:15:42,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:15:42,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:15:42,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:15:42" (1/1) ... [2025-03-17 12:15:42,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5d3808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:42, skipping insertion in model container [2025-03-17 12:15:42,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:15:42" (1/1) ... [2025-03-17 12:15:42,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:15:42,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:15:42,731 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:15:42,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:15:42,786 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:15:42,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:42 WrapperNode [2025-03-17 12:15:42,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:15:42,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:15:42,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:15:42,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:15:42,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:42" (1/1) ... [2025-03-17 12:15:42,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:42" (1/1) ... [2025-03-17 12:15:42,826 INFO L138 Inliner]: procedures = 127, calls = 41, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 137 [2025-03-17 12:15:42,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:15:42,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:15:42,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:15:42,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:15:42,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:42" (1/1) ... [2025-03-17 12:15:42,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:42" (1/1) ... [2025-03-17 12:15:42,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:42" (1/1) ... [2025-03-17 12:15:42,858 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 16, 6]. 67 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2025-03-17 12:15:42,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:42" (1/1) ... [2025-03-17 12:15:42,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:42" (1/1) ... [2025-03-17 12:15:42,869 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:42" (1/1) ... [2025-03-17 12:15:42,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:42" (1/1) ... [2025-03-17 12:15:42,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:42" (1/1) ... [2025-03-17 12:15:42,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:42" (1/1) ... [2025-03-17 12:15:42,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:15:42,882 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:15:42,886 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:15:42,887 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:15:42,887 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:42" (1/1) ... [2025-03-17 12:15:42,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:15:42,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:42,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:15:42,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:15:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 12:15:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 12:15:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 12:15:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:15:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 12:15:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 12:15:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-17 12:15:42,941 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-17 12:15:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:15:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:15:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 12:15:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:15:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 12:15:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 12:15:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:15:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 12:15:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 12:15:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:15:42,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 12:15:42,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 12:15:42,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 12:15:42,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:15:42,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 12:15:42,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 12:15:42,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:15:42,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:15:43,064 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:15:43,066 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:15:43,377 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L622: 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-17 12:15:43,425 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L578: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-17 12:15:43,451 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-03-17 12:15:43,451 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:15:43,465 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:15:43,466 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:15:43,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:15:43 BoogieIcfgContainer [2025-03-17 12:15:43,466 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:15:43,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:15:43,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:15:43,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:15:43,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:15:42" (1/3) ... [2025-03-17 12:15:43,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afc3490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:15:43, skipping insertion in model container [2025-03-17 12:15:43,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:42" (2/3) ... [2025-03-17 12:15:43,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afc3490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:15:43, skipping insertion in model container [2025-03-17 12:15:43,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:15:43" (3/3) ... [2025-03-17 12:15:43,475 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2025-03-17 12:15:43,491 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:15:43,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_append_unequal.i that has 2 procedures, 108 locations, 1 initial locations, 4 loop locations, and 47 error locations. [2025-03-17 12:15:43,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:15:43,540 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;@5141d5a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:15:43,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-03-17 12:15:43,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 104 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:15:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 12:15:43,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:43,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 12:15:43,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:15:43,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:43,555 INFO L85 PathProgramCache]: Analyzing trace with hash -123982058, now seen corresponding path program 1 times [2025-03-17 12:15:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:43,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628248310] [2025-03-17 12:15:43,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:43,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:43,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 12:15:43,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 12:15:43,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:43,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:43,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:43,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628248310] [2025-03-17 12:15:43,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628248310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:43,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:43,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:15:43,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481692284] [2025-03-17 12:15:43,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:43,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:15:43,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:43,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:15:43,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:43,798 INFO L87 Difference]: Start difference. First operand has 108 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 104 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 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-17 12:15:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:43,903 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2025-03-17 12:15:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:15:43,905 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-17 12:15:43,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:43,913 INFO L225 Difference]: With dead ends: 104 [2025-03-17 12:15:43,913 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 12:15:43,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:43,916 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:43,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 167 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:43,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 12:15:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 12:15:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 54 states have (on average 1.962962962962963) internal successors, (106), 97 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:15:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2025-03-17 12:15:43,961 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 6 [2025-03-17 12:15:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:43,962 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2025-03-17 12:15:43,962 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-17 12:15:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2025-03-17 12:15:43,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 12:15:43,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:43,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 12:15:43,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:15:43,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:15:43,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:43,963 INFO L85 PathProgramCache]: Analyzing trace with hash -123982057, now seen corresponding path program 1 times [2025-03-17 12:15:43,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:43,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600350079] [2025-03-17 12:15:43,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:43,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:43,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 12:15:43,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 12:15:43,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:43,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:44,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:44,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:44,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600350079] [2025-03-17 12:15:44,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600350079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:44,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:44,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:15:44,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987845882] [2025-03-17 12:15:44,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:44,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:15:44,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:44,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:15:44,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:44,073 INFO L87 Difference]: Start difference. First operand 101 states and 110 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-17 12:15:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:44,153 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2025-03-17 12:15:44,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:15:44,153 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-17 12:15:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:44,154 INFO L225 Difference]: With dead ends: 98 [2025-03-17 12:15:44,154 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 12:15:44,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:44,155 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 3 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:44,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 166 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:44,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 12:15:44,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-17 12:15:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 94 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:15:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2025-03-17 12:15:44,159 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 6 [2025-03-17 12:15:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:44,160 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2025-03-17 12:15:44,160 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-17 12:15:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2025-03-17 12:15:44,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 12:15:44,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:44,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:44,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:15:44,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:15:44,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:44,161 INFO L85 PathProgramCache]: Analyzing trace with hash 852474626, now seen corresponding path program 1 times [2025-03-17 12:15:44,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:44,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677339549] [2025-03-17 12:15:44,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:44,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:44,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 12:15:44,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 12:15:44,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:44,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:44,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:44,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677339549] [2025-03-17 12:15:44,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677339549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:44,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:44,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:15:44,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003600287] [2025-03-17 12:15:44,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:44,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:15:44,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:44,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:15:44,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:15:44,315 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-17 12:15:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:44,505 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2025-03-17 12:15:44,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:15:44,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-17 12:15:44,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:44,506 INFO L225 Difference]: With dead ends: 96 [2025-03-17 12:15:44,508 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 12:15:44,509 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-17 12:15:44,509 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 8 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:44,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 302 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:15:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 12:15:44,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-17 12:15:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:15:44,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2025-03-17 12:15:44,515 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 13 [2025-03-17 12:15:44,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:44,516 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2025-03-17 12:15:44,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-17 12:15:44,516 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2025-03-17 12:15:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 12:15:44,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:44,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:44,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:15:44,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:15:44,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 852474627, now seen corresponding path program 1 times [2025-03-17 12:15:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:44,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349681761] [2025-03-17 12:15:44,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:44,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 12:15:44,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 12:15:44,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:44,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:44,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:44,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349681761] [2025-03-17 12:15:44,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349681761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:44,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:44,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:15:44,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19015282] [2025-03-17 12:15:44,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:44,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:15:44,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:44,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:15:44,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:15:44,743 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-17 12:15:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:44,882 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2025-03-17 12:15:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:15:44,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-17 12:15:44,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:44,884 INFO L225 Difference]: With dead ends: 94 [2025-03-17 12:15:44,884 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 12:15:44,884 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-17 12:15:44,886 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 7 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:44,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 318 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:44,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 12:15:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-17 12:15:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:15:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2025-03-17 12:15:44,898 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 13 [2025-03-17 12:15:44,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:44,898 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2025-03-17 12:15:44,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-17 12:15:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2025-03-17 12:15:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 12:15:44,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:44,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:44,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:15:44,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:15:44,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:44,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1784833139, now seen corresponding path program 1 times [2025-03-17 12:15:44,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:44,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604936010] [2025-03-17 12:15:44,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:44,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:44,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 12:15:44,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 12:15:44,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:44,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:44,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:44,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:44,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604936010] [2025-03-17 12:15:44,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604936010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:44,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:44,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:15:44,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519056788] [2025-03-17 12:15:44,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:44,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:15:44,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:44,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:15:44,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:44,964 INFO L87 Difference]: Start difference. First operand 94 states and 103 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-17 12:15:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:44,974 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2025-03-17 12:15:44,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:15:44,975 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-17 12:15:44,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:44,975 INFO L225 Difference]: With dead ends: 104 [2025-03-17 12:15:44,975 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 12:15:44,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:44,976 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 9 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:44,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 200 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:15:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 12:15:44,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2025-03-17 12:15:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:15:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2025-03-17 12:15:44,983 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 13 [2025-03-17 12:15:44,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:44,983 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2025-03-17 12:15:44,983 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-17 12:15:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2025-03-17 12:15:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 12:15:44,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:44,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:44,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:15:44,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:15:44,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash -69966653, now seen corresponding path program 1 times [2025-03-17 12:15:44,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:44,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768402719] [2025-03-17 12:15:44,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:44,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:15:45,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:15:45,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:45,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:45,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:45,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768402719] [2025-03-17 12:15:45,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768402719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:45,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:45,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:15:45,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863717953] [2025-03-17 12:15:45,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:45,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:15:45,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:45,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:15:45,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:45,041 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:15:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:45,057 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2025-03-17 12:15:45,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:15:45,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-17 12:15:45,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:45,058 INFO L225 Difference]: With dead ends: 100 [2025-03-17 12:15:45,058 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 12:15:45,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:45,059 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:45,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:15:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 12:15:45,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-17 12:15:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 95 states have internal predecessors, (104), 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-17 12:15:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2025-03-17 12:15:45,068 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 16 [2025-03-17 12:15:45,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:45,068 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2025-03-17 12:15:45,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:15:45,068 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2025-03-17 12:15:45,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:15:45,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:45,068 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:45,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:15:45,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:15:45,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash 133436639, now seen corresponding path program 1 times [2025-03-17 12:15:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:45,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142967405] [2025-03-17 12:15:45,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:45,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:45,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:15:45,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:15:45,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:45,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:15:45,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:45,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142967405] [2025-03-17 12:15:45,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142967405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:45,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747528126] [2025-03-17 12:15:45,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:45,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:45,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:45,163 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:45,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:15:45,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:15:45,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:15:45,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:45,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:45,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 12:15:45,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:45,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:15:45,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747528126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:15:45,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:15:45,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-17 12:15:45,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489436139] [2025-03-17 12:15:45,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:45,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:15:45,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:45,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:15:45,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:15:45,396 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:15:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:45,413 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2025-03-17 12:15:45,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:15:45,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2025-03-17 12:15:45,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:45,417 INFO L225 Difference]: With dead ends: 102 [2025-03-17 12:15:45,417 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 12:15:45,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:15:45,418 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 9 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:45,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 289 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:15:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 12:15:45,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-17 12:15:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 61 states have (on average 1.7377049180327868) internal successors, (106), 97 states have internal predecessors, (106), 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-17 12:15:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2025-03-17 12:15:45,423 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 28 [2025-03-17 12:15:45,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:45,423 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2025-03-17 12:15:45,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:15:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2025-03-17 12:15:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 12:15:45,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:45,424 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 12:15:45,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 12:15:45,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:45,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:15:45,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1729850831, now seen corresponding path program 1 times [2025-03-17 12:15:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:45,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101989972] [2025-03-17 12:15:45,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:45,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:45,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:15:45,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:15:45,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:45,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:45,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:45,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101989972] [2025-03-17 12:15:45,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101989972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:45,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314481005] [2025-03-17 12:15:45,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:45,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:45,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:45,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:45,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:15:46,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:15:46,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:15:46,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:46,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:46,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 12:15:46,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:46,124 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-17 12:15:46,173 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:15:46,174 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-17 12:15:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:46,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:46,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314481005] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:15:46,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:15:46,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 4] total 12 [2025-03-17 12:15:46,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064329174] [2025-03-17 12:15:46,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:46,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 12:15:46,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:46,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 12:15:46,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2025-03-17 12:15:46,395 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 12:15:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:46,710 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2025-03-17 12:15:46,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:15:46,711 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 31 [2025-03-17 12:15:46,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:46,712 INFO L225 Difference]: With dead ends: 101 [2025-03-17 12:15:46,712 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 12:15:46,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2025-03-17 12:15:46,713 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:46,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 446 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 388 Invalid, 0 Unknown, 102 Unchecked, 0.3s Time] [2025-03-17 12:15:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 12:15:46,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 12:15:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 61 states have (on average 1.721311475409836) internal successors, (105), 96 states have internal predecessors, (105), 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-17 12:15:46,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2025-03-17 12:15:46,717 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 31 [2025-03-17 12:15:46,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:46,717 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2025-03-17 12:15:46,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 12:15:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2025-03-17 12:15:46,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 12:15:46,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:46,718 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 12:15:46,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 12:15:46,922 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,SelfDestructingSolverStorable7 [2025-03-17 12:15:46,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:15:46,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:46,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1729850830, now seen corresponding path program 1 times [2025-03-17 12:15:46,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:46,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324002738] [2025-03-17 12:15:46,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:46,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:46,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:15:46,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:15:46,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:46,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:47,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:47,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324002738] [2025-03-17 12:15:47,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324002738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:47,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655075498] [2025-03-17 12:15:47,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:47,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:47,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:47,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:47,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 12:15:47,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:15:47,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:15:47,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:47,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:47,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 12:15:47,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:47,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:15:47,648 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-17 12:15:47,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:15:47,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:15:47,695 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:15:47,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:15:47,725 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-03-17 12:15:47,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:47,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655075498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:47,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:47,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2025-03-17 12:15:47,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631838785] [2025-03-17 12:15:47,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:47,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 12:15:47,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:47,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 12:15:47,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=361, Unknown=1, NotChecked=38, Total=462 [2025-03-17 12:15:47,836 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 17 states have internal predecessors, (52), 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-17 12:15:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:48,268 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2025-03-17 12:15:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:15:48,269 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 17 states have internal predecessors, (52), 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 31 [2025-03-17 12:15:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:48,269 INFO L225 Difference]: With dead ends: 100 [2025-03-17 12:15:48,269 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 12:15:48,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=556, Unknown=1, NotChecked=48, Total=702 [2025-03-17 12:15:48,270 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 4 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:48,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 622 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 530 Invalid, 0 Unknown, 101 Unchecked, 0.3s Time] [2025-03-17 12:15:48,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 12:15:48,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-17 12:15:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.7049180327868851) internal successors, (104), 95 states have internal predecessors, (104), 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-17 12:15:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2025-03-17 12:15:48,274 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 31 [2025-03-17 12:15:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:48,274 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2025-03-17 12:15:48,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 17 states have internal predecessors, (52), 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-17 12:15:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2025-03-17 12:15:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 12:15:48,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:48,275 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:48,281 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-17 12:15:48,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:48,479 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:15:48,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:48,479 INFO L85 PathProgramCache]: Analyzing trace with hash 292916557, now seen corresponding path program 2 times [2025-03-17 12:15:48,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:48,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846636655] [2025-03-17 12:15:48,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:15:48,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:48,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-17 12:15:48,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 12:15:48,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:15:48,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 12:15:48,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:48,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846636655] [2025-03-17 12:15:48,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846636655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:48,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814966111] [2025-03-17 12:15:48,621 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:15:48,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:48,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:48,623 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:48,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 12:15:48,706 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-17 12:15:48,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 12:15:48,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:15:48,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:48,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 12:15:48,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:48,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 12:15:48,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814966111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:15:48,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:15:48,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-03-17 12:15:48,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295469792] [2025-03-17 12:15:48,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:48,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:15:48,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:48,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:15:48,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:15:48,826 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:15:48,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:48,896 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2025-03-17 12:15:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:15:48,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2025-03-17 12:15:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:48,897 INFO L225 Difference]: With dead ends: 100 [2025-03-17 12:15:48,897 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 12:15:48,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:15:48,899 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:48,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 541 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:48,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 12:15:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-17 12:15:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.6885245901639345) internal successors, (103), 95 states have internal predecessors, (103), 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-17 12:15:48,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2025-03-17 12:15:48,906 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 43 [2025-03-17 12:15:48,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:48,906 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2025-03-17 12:15:48,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:15:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2025-03-17 12:15:48,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:15:48,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:48,907 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:48,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 12:15:49,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:49,108 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:15:49,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:49,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1975456721, now seen corresponding path program 1 times [2025-03-17 12:15:49,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:49,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971346315] [2025-03-17 12:15:49,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:49,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:49,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:15:49,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:15:49,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:49,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:15:49,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:49,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971346315] [2025-03-17 12:15:49,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971346315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:49,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200493070] [2025-03-17 12:15:49,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:49,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:49,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:49,556 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:49,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 12:15:49,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:15:49,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:15:49,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:49,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:49,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 12:15:49,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:49,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:15:49,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:15:49,733 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:15:49,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:15:49,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:15:49,806 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|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-03-17 12:15:49,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:15:49,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:15:49,870 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-17 12:15:49,891 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:15:49,891 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-17 12:15:49,903 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 21 not checked. [2025-03-17 12:15:49,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:50,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200493070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:50,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:50,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2025-03-17 12:15:50,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986345336] [2025-03-17 12:15:50,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:50,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 12:15:50,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:50,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 12:15:50,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=254, Unknown=2, NotChecked=66, Total=380 [2025-03-17 12:15:50,064 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 12:15:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:50,437 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2025-03-17 12:15:50,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:15:50,438 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2025-03-17 12:15:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:50,438 INFO L225 Difference]: With dead ends: 106 [2025-03-17 12:15:50,438 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 12:15:50,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=343, Unknown=2, NotChecked=78, Total=506 [2025-03-17 12:15:50,439 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 78 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:50,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 337 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 393 Invalid, 0 Unknown, 202 Unchecked, 0.3s Time] [2025-03-17 12:15:50,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 12:15:50,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2025-03-17 12:15:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 90 states have internal predecessors, (98), 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-17 12:15:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2025-03-17 12:15:50,449 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 44 [2025-03-17 12:15:50,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:50,450 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2025-03-17 12:15:50,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 12:15:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2025-03-17 12:15:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:15:50,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:50,451 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:50,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 12:15:50,654 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,SelfDestructingSolverStorable10 [2025-03-17 12:15:50,655 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:15:50,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:50,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1975456720, now seen corresponding path program 1 times [2025-03-17 12:15:50,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:50,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151377632] [2025-03-17 12:15:50,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:50,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:50,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:15:50,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:15:50,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:50,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 12:15:51,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151377632] [2025-03-17 12:15:51,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151377632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:51,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:51,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:15:51,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396177238] [2025-03-17 12:15:51,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:51,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:15:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:51,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:15:51,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:15:51,067 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:15:51,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:51,200 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2025-03-17 12:15:51,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:15:51,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-03-17 12:15:51,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:51,201 INFO L225 Difference]: With dead ends: 90 [2025-03-17 12:15:51,201 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 12:15:51,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:15:51,202 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 63 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:51,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 261 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 12:15:51,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 12:15:51,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 85 states have internal predecessors, (93), 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-17 12:15:51,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2025-03-17 12:15:51,204 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 44 [2025-03-17 12:15:51,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:51,204 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2025-03-17 12:15:51,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:15:51,204 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2025-03-17 12:15:51,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 12:15:51,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:51,206 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:15:51,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:15:51,206 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:15:51,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1788667816, now seen corresponding path program 1 times [2025-03-17 12:15:51,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:51,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787693288] [2025-03-17 12:15:51,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:51,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:51,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 12:15:51,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:15:51,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:51,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:15:51,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:51,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787693288] [2025-03-17 12:15:51,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787693288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:51,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989905365] [2025-03-17 12:15:51,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:51,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:51,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:51,567 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:51,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 12:15:51,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 12:15:51,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:15:51,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:51,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:51,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 12:15:51,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:51,884 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-17 12:15:51,892 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-17 12:15:51,935 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-17 12:15:51,935 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-17 12:15:51,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 12:15:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 12:15:51,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:15:51,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989905365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:51,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:15:51,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 18 [2025-03-17 12:15:51,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976842078] [2025-03-17 12:15:51,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:51,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:15:51,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:51,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:15:51,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=264, Unknown=1, NotChecked=32, Total=342 [2025-03-17 12:15:51,954 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:15:52,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:52,077 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2025-03-17 12:15:52,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:15:52,077 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2025-03-17 12:15:52,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:52,078 INFO L225 Difference]: With dead ends: 89 [2025-03-17 12:15:52,078 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 12:15:52,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=295, Unknown=1, NotChecked=34, Total=380 [2025-03-17 12:15:52,079 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 10 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:52,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 328 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 234 Invalid, 0 Unknown, 152 Unchecked, 0.1s Time] [2025-03-17 12:15:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 12:15:52,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 12:15:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.5) internal successors, (93), 84 states have internal predecessors, (93), 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-17 12:15:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2025-03-17 12:15:52,085 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 48 [2025-03-17 12:15:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:52,086 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2025-03-17 12:15:52,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:15:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2025-03-17 12:15:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 12:15:52,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:52,089 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:15:52,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 12:15:52,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:52,290 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:15:52,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:52,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1788667817, now seen corresponding path program 1 times [2025-03-17 12:15:52,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:52,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817731170] [2025-03-17 12:15:52,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:52,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:52,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 12:15:52,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:15:52,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:52,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:15:52,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:52,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817731170] [2025-03-17 12:15:52,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817731170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:52,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865901425] [2025-03-17 12:15:52,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:52,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:52,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:52,874 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:52,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 12:15:52,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 12:15:53,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:15:53,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:53,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:53,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-17 12:15:53,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:53,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:15:53,265 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-17 12:15:53,378 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-17 12:15:53,378 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-17 12:15:53,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 12:15:53,468 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:15:53,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:53,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865901425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:53,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:53,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2025-03-17 12:15:53,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086033493] [2025-03-17 12:15:53,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:53,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 12:15:53,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:53,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 12:15:53,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2025-03-17 12:15:53,639 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 26 states, 24 states have (on average 3.125) internal successors, (75), 22 states have internal predecessors, (75), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:15:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:54,481 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2025-03-17 12:15:54,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 12:15:54,482 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.125) internal successors, (75), 22 states have internal predecessors, (75), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2025-03-17 12:15:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:54,483 INFO L225 Difference]: With dead ends: 103 [2025-03-17 12:15:54,483 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 12:15:54,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=1720, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 12:15:54,484 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 79 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:54,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 765 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 921 Invalid, 1 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 12:15:54,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 12:15:54,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2025-03-17 12:15:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 94 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2025-03-17 12:15:54,489 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 48 [2025-03-17 12:15:54,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:54,489 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2025-03-17 12:15:54,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.125) internal successors, (75), 22 states have internal predecessors, (75), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:15:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2025-03-17 12:15:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 12:15:54,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:54,490 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:15:54,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 12:15:54,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:54,691 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:15:54,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:54,691 INFO L85 PathProgramCache]: Analyzing trace with hash 272019334, now seen corresponding path program 1 times [2025-03-17 12:15:54,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:54,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128117632] [2025-03-17 12:15:54,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:54,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:54,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 12:15:54,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 12:15:54,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:54,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 12:15:54,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:54,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128117632] [2025-03-17 12:15:54,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128117632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:54,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:54,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 12:15:54,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76039062] [2025-03-17 12:15:54,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:54,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:15:54,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:54,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:15:54,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:15:54,942 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 10 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:15:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:55,154 INFO L93 Difference]: Finished difference Result 148 states and 164 transitions. [2025-03-17 12:15:55,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:15:55,155 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-03-17 12:15:55,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:55,156 INFO L225 Difference]: With dead ends: 148 [2025-03-17 12:15:55,156 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 12:15:55,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:15:55,157 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 77 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:55,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 359 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:15:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 12:15:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 102. [2025-03-17 12:15:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 96 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2025-03-17 12:15:55,161 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 50 [2025-03-17 12:15:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:55,161 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2025-03-17 12:15:55,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:15:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2025-03-17 12:15:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 12:15:55,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:55,162 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:15:55,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 12:15:55,163 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:15:55,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:55,163 INFO L85 PathProgramCache]: Analyzing trace with hash 272019335, now seen corresponding path program 1 times [2025-03-17 12:15:55,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:55,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255546414] [2025-03-17 12:15:55,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:55,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:55,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 12:15:55,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 12:15:55,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:55,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 12:15:55,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:55,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255546414] [2025-03-17 12:15:55,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255546414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:55,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626194995] [2025-03-17 12:15:55,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:55,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:55,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:55,366 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:55,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 12:15:55,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 12:15:55,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 12:15:55,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:55,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:55,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 12:15:55,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:55,687 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:15:55,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:15:55,688 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 16 treesize of output 11 [2025-03-17 12:15:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:15:55,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:55,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:15:55,737 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 17 treesize of output 17 [2025-03-17 12:15:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 12:15:55,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626194995] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:15:55,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:15:55,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 20 [2025-03-17 12:15:55,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105944151] [2025-03-17 12:15:55,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:55,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 12:15:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:55,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 12:15:55,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:15:55,875 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 12:15:59,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:03,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:07,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:11,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:15,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:19,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:23,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:28,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:28,150 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2025-03-17 12:16:28,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 12:16:28,151 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 50 [2025-03-17 12:16:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:28,152 INFO L225 Difference]: With dead ends: 97 [2025-03-17 12:16:28,152 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 12:16:28,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2025-03-17 12:16:28,153 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 133 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:28,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 765 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 8 Unknown, 0 Unchecked, 32.2s Time] [2025-03-17 12:16:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 12:16:28,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-17 12:16:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 91 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:16:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2025-03-17 12:16:28,158 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 50 [2025-03-17 12:16:28,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:28,159 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2025-03-17 12:16:28,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 12:16:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2025-03-17 12:16:28,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 12:16:28,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:28,160 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:16:28,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 12:16:28,360 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,SelfDestructingSolverStorable15 [2025-03-17 12:16:28,360 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:16:28,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:28,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1456285625, now seen corresponding path program 1 times [2025-03-17 12:16:28,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:28,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150134411] [2025-03-17 12:16:28,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:28,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:28,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:16:28,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:16:28,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:28,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 12:16:28,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:16:28,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150134411] [2025-03-17 12:16:28,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150134411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:16:28,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:16:28,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:16:28,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161541655] [2025-03-17 12:16:28,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:16:28,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:16:28,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:16:28,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:16:28,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:16:28,450 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-17 12:16:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:28,531 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2025-03-17 12:16:28,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:16:28,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 51 [2025-03-17 12:16:28,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:28,531 INFO L225 Difference]: With dead ends: 96 [2025-03-17 12:16:28,532 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 12:16:28,532 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-17 12:16:28,532 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 8 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:28,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 244 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:16:28,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 12:16:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-17 12:16:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.375) internal successors, (99), 90 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:16:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2025-03-17 12:16:28,534 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 51 [2025-03-17 12:16:28,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:28,534 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2025-03-17 12:16:28,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-17 12:16:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2025-03-17 12:16:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 12:16:28,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:28,536 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:16:28,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 12:16:28,537 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:16:28,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1456285624, now seen corresponding path program 1 times [2025-03-17 12:16:28,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:28,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726983664] [2025-03-17 12:16:28,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:28,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:28,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:16:28,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:16:28,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:28,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 12:16:28,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:16:28,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726983664] [2025-03-17 12:16:28,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726983664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:16:28,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:16:28,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:16:28,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890554600] [2025-03-17 12:16:28,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:16:28,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:16:28,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:16:28,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:16:28,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:16:28,707 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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-17 12:16:28,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:28,797 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2025-03-17 12:16:28,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:16:28,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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 51 [2025-03-17 12:16:28,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:28,798 INFO L225 Difference]: With dead ends: 95 [2025-03-17 12:16:28,798 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 12:16:28,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:16:28,799 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 9 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:28,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 306 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:16:28,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 12:16:28,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-17 12:16:28,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 89 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:16:28,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2025-03-17 12:16:28,802 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 51 [2025-03-17 12:16:28,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:28,802 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2025-03-17 12:16:28,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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-17 12:16:28,802 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2025-03-17 12:16:28,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 12:16:28,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:28,802 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:16:28,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 12:16:28,802 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:16:28,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:28,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2099760171, now seen corresponding path program 1 times [2025-03-17 12:16:28,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:28,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149895886] [2025-03-17 12:16:28,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:28,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:28,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 12:16:28,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 12:16:28,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:28,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:16:29,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:16:29,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149895886] [2025-03-17 12:16:29,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149895886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:29,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598766998] [2025-03-17 12:16:29,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:29,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:29,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:16:29,665 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:16:29,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 12:16:29,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 12:16:30,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 12:16:30,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:30,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:30,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-17 12:16:30,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:16:30,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:16:30,315 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:16:30,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:16:30,417 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 13 treesize of output 9 [2025-03-17 12:16:30,473 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:16:30,473 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 42 treesize of output 41 [2025-03-17 12:16:30,589 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 42 treesize of output 14 [2025-03-17 12:16:30,592 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-17 12:16:30,651 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |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-17 12:16:30,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:16:30,671 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 50 treesize of output 39 [2025-03-17 12:16:30,690 INFO L349 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2025-03-17 12:16:30,690 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 40 treesize of output 69 [2025-03-17 12:16:30,808 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 84 treesize of output 56 [2025-03-17 12:16:30,813 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 51 treesize of output 35 [2025-03-17 12:16:30,962 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 41 treesize of output 17 [2025-03-17 12:16:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-17 12:16:31,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:16:31,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598766998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:31,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:16:31,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 44 [2025-03-17 12:16:31,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741320269] [2025-03-17 12:16:31,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:16:31,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-17 12:16:31,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:16:31,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-17 12:16:31,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2103, Unknown=1, NotChecked=92, Total=2352 [2025-03-17 12:16:31,261 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 45 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 40 states have internal predecessors, (91), 6 states have call successors, (6), 3 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-17 12:16:32,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:32,477 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2025-03-17 12:16:32,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 12:16:32,478 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 40 states have internal predecessors, (91), 6 states have call successors, (6), 3 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 52 [2025-03-17 12:16:32,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:32,478 INFO L225 Difference]: With dead ends: 107 [2025-03-17 12:16:32,478 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 12:16:32,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=325, Invalid=3968, Unknown=1, NotChecked=128, Total=4422 [2025-03-17 12:16:32,480 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 93 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:32,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1029 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1281 Invalid, 0 Unknown, 109 Unchecked, 0.7s Time] [2025-03-17 12:16:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 12:16:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2025-03-17 12:16:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 74 states have (on average 1.364864864864865) internal successors, (101), 91 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:16:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2025-03-17 12:16:32,482 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 52 [2025-03-17 12:16:32,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:32,483 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2025-03-17 12:16:32,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 40 states have internal predecessors, (91), 6 states have call successors, (6), 3 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-17 12:16:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2025-03-17 12:16:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 12:16:32,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:32,483 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 12:16:32,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 12:16:32,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:32,687 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-03-17 12:16:32,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:32,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2099760172, now seen corresponding path program 1 times [2025-03-17 12:16:32,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:32,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505019958] [2025-03-17 12:16:32,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:32,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:32,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 12:16:32,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 12:16:32,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:32,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:16:34,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:16:34,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505019958] [2025-03-17 12:16:34,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505019958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:34,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058027939] [2025-03-17 12:16:34,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:34,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:34,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:16:34,301 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:16:34,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 12:16:34,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 12:16:34,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 12:16:34,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:34,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:34,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 121 conjuncts are in the unsatisfiable core [2025-03-17 12:16:34,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:16:34,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:16:34,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:16:35,097 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:16:35,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:16:35,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:16:35,210 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-17 12:16:35,215 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-17 12:16:35,273 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:16:35,273 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-17 12:16:35,278 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-17 12:16:35,421 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-17 12:16:35,424 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 9 treesize of output 3 [2025-03-17 12:16:35,428 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-17 12:16:35,431 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-17 12:16:50,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:16:50,356 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-17 12:16:50,395 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2025-03-17 12:16:50,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2025-03-17 12:16:50,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:16:50,407 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 20 treesize of output 15 [2025-03-17 12:16:50,422 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 12:16:50,422 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-17 12:16:50,718 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 56 treesize of output 32 [2025-03-17 12:16:51,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 12:16:51,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 12:16:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:16:51,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:16:51,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058027939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:51,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:16:51,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 49 [2025-03-17 12:16:51,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708014404] [2025-03-17 12:16:51,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:16:51,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-17 12:16:51,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:16:51,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-17 12:16:51,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2896, Unknown=2, NotChecked=0, Total=3080 [2025-03-17 12:16:51,680 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 50 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 43 states have internal predecessors, (90), 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-17 12:16:57,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:17:01,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:17:06,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:17:11,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:17:15,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]