./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/sll2n_prepend_equal.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 e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:48:44,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:48:44,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:48:44,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:48:44,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:48:44,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:48:44,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:48:44,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:48:44,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:48:44,613 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:48:44,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:48:44,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:48:44,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:48:44,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:48:44,614 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:48:44,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:48:44,615 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:48:44,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:48:44,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:48:44,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:48:44,616 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:48:44,616 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:48:44,616 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:48:44,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:48:44,617 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:48:44,617 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:48:44,617 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:48:44,617 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:48:44,617 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:48:44,618 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:48:44,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:48:44,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:48:44,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:48:44,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:48:44,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:48:44,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:48:44,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:48:44,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:48:44,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:48:44,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:48:44,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:48:44,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:48:44,621 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2024-11-17 00:48:44,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:48:44,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:48:44,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:48:44,847 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:48:44,848 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:48:44,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-11-17 00:48:46,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:48:46,256 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:48:46,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-11-17 00:48:46,264 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12882d15b/f78bd6ab5f1b4301bf39680df5915297/FLAG449737681 [2024-11-17 00:48:46,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12882d15b/f78bd6ab5f1b4301bf39680df5915297 [2024-11-17 00:48:46,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:48:46,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:48:46,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:48:46,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:48:46,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:48:46,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:48:46" (1/1) ... [2024-11-17 00:48:46,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53047fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:46, skipping insertion in model container [2024-11-17 00:48:46,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:48:46" (1/1) ... [2024-11-17 00:48:46,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:48:46,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:48:46,888 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:48:46,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:48:46,947 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:48:46,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:46 WrapperNode [2024-11-17 00:48:46,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:48:46,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:48:46,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:48:46,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:48:46,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:46" (1/1) ... [2024-11-17 00:48:46,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:46" (1/1) ... [2024-11-17 00:48:47,008 INFO L138 Inliner]: procedures = 127, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 107 [2024-11-17 00:48:47,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:48:47,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:48:47,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:48:47,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:48:47,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:46" (1/1) ... [2024-11-17 00:48:47,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:46" (1/1) ... [2024-11-17 00:48:47,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:46" (1/1) ... [2024-11-17 00:48:47,050 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2024-11-17 00:48:47,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:46" (1/1) ... [2024-11-17 00:48:47,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:46" (1/1) ... [2024-11-17 00:48:47,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:46" (1/1) ... [2024-11-17 00:48:47,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:46" (1/1) ... [2024-11-17 00:48:47,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:46" (1/1) ... [2024-11-17 00:48:47,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:46" (1/1) ... [2024-11-17 00:48:47,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:48:47,061 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:48:47,062 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:48:47,062 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:48:47,062 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:46" (1/1) ... [2024-11-17 00:48:47,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:48:47,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:47,100 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) [2024-11-17 00:48:47,103 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 [2024-11-17 00:48:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:48:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:48:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 00:48:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:48:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:48:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 00:48:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-17 00:48:47,149 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-17 00:48:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:48:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:48:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:48:47,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:48:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:48:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:48:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:48:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:48:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:48:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:48:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 00:48:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 00:48:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-17 00:48:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:48:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:48:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 00:48:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:48:47,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:48:47,277 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:48:47,279 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:48:47,449 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L607: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-17 00:48:47,484 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-17 00:48:47,507 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-11-17 00:48:47,508 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:48:47,521 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:48:47,522 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:48:47,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:48:47 BoogieIcfgContainer [2024-11-17 00:48:47,523 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:48:47,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:48:47,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:48:47,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:48:47,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:48:46" (1/3) ... [2024-11-17 00:48:47,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c91be5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:48:47, skipping insertion in model container [2024-11-17 00:48:47,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:46" (2/3) ... [2024-11-17 00:48:47,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c91be5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:48:47, skipping insertion in model container [2024-11-17 00:48:47,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:48:47" (3/3) ... [2024-11-17 00:48:47,530 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2024-11-17 00:48:47,547 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:48:47,550 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2024-11-17 00:48:47,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:48:47,594 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;@3ed1de37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:48:47,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-11-17 00:48:47,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 50 states have (on average 1.74) internal successors, (87), 77 states have internal predecessors, (87), 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) [2024-11-17 00:48:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:48:47,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:47,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:47,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:48:47,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:47,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1055831499, now seen corresponding path program 1 times [2024-11-17 00:48:47,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:47,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095261902] [2024-11-17 00:48:47,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:47,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:48:47,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:47,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095261902] [2024-11-17 00:48:47,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095261902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:47,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:47,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:48:47,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357718981] [2024-11-17 00:48:47,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:47,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:48:47,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:47,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:48:47,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:48:47,851 INFO L87 Difference]: Start difference. First operand has 81 states, 50 states have (on average 1.74) internal successors, (87), 77 states have internal predecessors, (87), 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 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-11-17 00:48:47,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:47,919 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-17 00:48:47,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:48:47,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-11-17 00:48:47,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:47,926 INFO L225 Difference]: With dead ends: 78 [2024-11-17 00:48:47,926 INFO L226 Difference]: Without dead ends: 74 [2024-11-17 00:48:47,927 INFO L431 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 [2024-11-17 00:48:47,929 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:47,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 124 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-17 00:48:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-17 00:48:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.608695652173913) internal successors, (74), 70 states have internal predecessors, (74), 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) [2024-11-17 00:48:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2024-11-17 00:48:47,953 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 8 [2024-11-17 00:48:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:47,953 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2024-11-17 00:48:47,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-11-17 00:48:47,954 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2024-11-17 00:48:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:48:47,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:47,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:47,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:48:47,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:48:47,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:47,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1055831498, now seen corresponding path program 1 times [2024-11-17 00:48:47,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:47,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403536420] [2024-11-17 00:48:47,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:47,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:48:48,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:48,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403536420] [2024-11-17 00:48:48,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403536420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:48,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:48,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:48:48,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843163709] [2024-11-17 00:48:48,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:48,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:48:48,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:48,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:48:48,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:48:48,067 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-11-17 00:48:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:48,106 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-11-17 00:48:48,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:48:48,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-11-17 00:48:48,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:48,108 INFO L225 Difference]: With dead ends: 72 [2024-11-17 00:48:48,108 INFO L226 Difference]: Without dead ends: 72 [2024-11-17 00:48:48,108 INFO L431 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 [2024-11-17 00:48:48,109 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:48,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 123 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:48:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-17 00:48:48,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-17 00:48:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.565217391304348) internal successors, (72), 68 states have internal predecessors, (72), 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) [2024-11-17 00:48:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-17 00:48:48,115 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 8 [2024-11-17 00:48:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:48,116 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-17 00:48:48,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-11-17 00:48:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-17 00:48:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 00:48:48,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:48,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:48,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:48:48,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:48:48,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash -741180619, now seen corresponding path program 1 times [2024-11-17 00:48:48,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:48,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644627651] [2024-11-17 00:48:48,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:48,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:48,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:48:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:48:48,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:48,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644627651] [2024-11-17 00:48:48,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644627651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:48,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:48,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:48:48,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6354940] [2024-11-17 00:48:48,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:48,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:48:48,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:48,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:48:48,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:48:48,309 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:48:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:48,421 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-11-17 00:48:48,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:48:48,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-17 00:48:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:48,422 INFO L225 Difference]: With dead ends: 71 [2024-11-17 00:48:48,422 INFO L226 Difference]: Without dead ends: 71 [2024-11-17 00:48:48,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:48:48,423 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:48,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 258 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:48,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-17 00:48:48,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-17 00:48:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 67 states have internal predecessors, (71), 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) [2024-11-17 00:48:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-17 00:48:48,428 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 14 [2024-11-17 00:48:48,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:48,429 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-17 00:48:48,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:48:48,429 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-17 00:48:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 00:48:48,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:48,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:48,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:48:48,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:48:48,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash -741180618, now seen corresponding path program 1 times [2024-11-17 00:48:48,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:48,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864643923] [2024-11-17 00:48:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:48,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:48,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:48:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:48:48,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:48,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864643923] [2024-11-17 00:48:48,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864643923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:48,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:48,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:48:48,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598395376] [2024-11-17 00:48:48,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:48,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:48:48,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:48,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:48:48,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:48:48,682 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:48:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:48,792 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2024-11-17 00:48:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:48:48,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-17 00:48:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:48,793 INFO L225 Difference]: With dead ends: 70 [2024-11-17 00:48:48,793 INFO L226 Difference]: Without dead ends: 70 [2024-11-17 00:48:48,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:48:48,794 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 1 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:48,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 278 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-17 00:48:48,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-17 00:48:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 66 states have internal predecessors, (70), 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) [2024-11-17 00:48:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2024-11-17 00:48:48,798 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 14 [2024-11-17 00:48:48,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:48,798 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2024-11-17 00:48:48,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:48:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2024-11-17 00:48:48,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:48:48,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:48,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:48,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:48:48,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:48:48,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:48,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1456322930, now seen corresponding path program 1 times [2024-11-17 00:48:48,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:48,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665536757] [2024-11-17 00:48:48,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:48,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:48,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-17 00:48:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:48:48,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:48,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665536757] [2024-11-17 00:48:48,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665536757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:48,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:48,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:48:48,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173196844] [2024-11-17 00:48:48,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:48,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:48:48,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:48,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:48:48,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:48:48,846 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 4 states, 4 states have (on average 3.5) 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) [2024-11-17 00:48:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:48,893 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2024-11-17 00:48:48,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:48:48,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) 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 [2024-11-17 00:48:48,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:48,894 INFO L225 Difference]: With dead ends: 76 [2024-11-17 00:48:48,894 INFO L226 Difference]: Without dead ends: 76 [2024-11-17 00:48:48,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:48:48,895 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 3 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:48,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 174 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:48:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-17 00:48:48,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2024-11-17 00:48:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.5) internal successors, (72), 68 states have internal predecessors, (72), 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) [2024-11-17 00:48:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-17 00:48:48,900 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 16 [2024-11-17 00:48:48,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:48,900 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-17 00:48:48,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) 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) [2024-11-17 00:48:48,901 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-17 00:48:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:48:48,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:48,902 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:48,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:48:48,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:48:48,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:48,903 INFO L85 PathProgramCache]: Analyzing trace with hash 376437734, now seen corresponding path program 1 times [2024-11-17 00:48:48,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:48,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219697964] [2024-11-17 00:48:48,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:48,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:48,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:48:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:49,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-17 00:48:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-17 00:48:49,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:49,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219697964] [2024-11-17 00:48:49,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219697964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:49,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163173743] [2024-11-17 00:48:49,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:49,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:49,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:49,015 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) [2024-11-17 00:48:49,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 00:48:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:49,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:48:49,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:48:49,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-17 00:48:49,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163173743] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:48:49,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:48:49,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-17 00:48:49,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313023645] [2024-11-17 00:48:49,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:49,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:48:49,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:49,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:48:49,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:48:49,191 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:48:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:49,243 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-17 00:48:49,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:48:49,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-17 00:48:49,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:49,244 INFO L225 Difference]: With dead ends: 78 [2024-11-17 00:48:49,244 INFO L226 Difference]: Without dead ends: 78 [2024-11-17 00:48:49,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:48:49,245 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 3 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:49,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 174 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:48:49,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-17 00:48:49,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-17 00:48:49,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 73 states have internal predecessors, (77), 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) [2024-11-17 00:48:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-17 00:48:49,254 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 29 [2024-11-17 00:48:49,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:49,254 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-17 00:48:49,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:48:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-17 00:48:49,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-17 00:48:49,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:49,256 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:49,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 00:48:49,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-17 00:48:49,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:48:49,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:49,457 INFO L85 PathProgramCache]: Analyzing trace with hash -729262606, now seen corresponding path program 2 times [2024-11-17 00:48:49,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:49,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011404914] [2024-11-17 00:48:49,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:49,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:49,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:48:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:49,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 00:48:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:49,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 00:48:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-17 00:48:49,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:49,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011404914] [2024-11-17 00:48:49,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011404914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:49,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183139974] [2024-11-17 00:48:49,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:48:49,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:49,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:49,924 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) [2024-11-17 00:48:49,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 00:48:50,047 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:48:50,047 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:48:50,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-17 00:48:50,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:50,077 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 [2024-11-17 00:48:50,144 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:48:50,145 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 [2024-11-17 00:48:50,226 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:48:50,226 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 [2024-11-17 00:48:50,277 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 [2024-11-17 00:48:50,298 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:48:50,299 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 [2024-11-17 00:48:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 12 not checked. [2024-11-17 00:48:50,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-17 00:48:50,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183139974] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:50,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:48:50,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 9] total 20 [2024-11-17 00:48:50,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698642875] [2024-11-17 00:48:50,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:50,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:48:50,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:50,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:48:50,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=303, Unknown=1, NotChecked=36, Total=420 [2024-11-17 00:48:50,701 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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) [2024-11-17 00:48:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:50,822 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2024-11-17 00:48:50,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:48:50,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 42 [2024-11-17 00:48:50,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:50,823 INFO L225 Difference]: With dead ends: 88 [2024-11-17 00:48:50,823 INFO L226 Difference]: Without dead ends: 88 [2024-11-17 00:48:50,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 70 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=335, Unknown=1, NotChecked=38, Total=462 [2024-11-17 00:48:50,824 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 142 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:50,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 173 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:50,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-17 00:48:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 74. [2024-11-17 00:48:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 69 states have internal predecessors, (73), 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) [2024-11-17 00:48:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2024-11-17 00:48:50,828 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 42 [2024-11-17 00:48:50,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:50,828 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2024-11-17 00:48:50,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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) [2024-11-17 00:48:50,828 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2024-11-17 00:48:50,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-17 00:48:50,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:50,829 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:50,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-17 00:48:51,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-17 00:48:51,035 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:48:51,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:51,035 INFO L85 PathProgramCache]: Analyzing trace with hash -729262605, now seen corresponding path program 1 times [2024-11-17 00:48:51,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:51,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297275789] [2024-11-17 00:48:51,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:51,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:51,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:48:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:51,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 00:48:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:51,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 00:48:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 00:48:51,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:51,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297275789] [2024-11-17 00:48:51,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297275789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:51,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756409740] [2024-11-17 00:48:51,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:51,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:51,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:51,570 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) [2024-11-17 00:48:51,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 00:48:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:51,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 00:48:51,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:51,700 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 [2024-11-17 00:48:51,733 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 [2024-11-17 00:48:51,750 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-17 00:48:51,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:51,786 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 [2024-11-17 00:48:51,814 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 [2024-11-17 00:48:51,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:51,845 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 [2024-11-17 00:48:51,898 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 [2024-11-17 00:48:51,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:51,946 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 [2024-11-17 00:48:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-17 00:48:51,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:48:51,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756409740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:51,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:48:51,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-17 00:48:51,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342053613] [2024-11-17 00:48:51,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:51,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:48:51,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:51,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:48:51,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2024-11-17 00:48:51,954 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) [2024-11-17 00:48:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:52,023 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2024-11-17 00:48:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:48:52,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 42 [2024-11-17 00:48:52,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:52,024 INFO L225 Difference]: With dead ends: 72 [2024-11-17 00:48:52,025 INFO L226 Difference]: Without dead ends: 72 [2024-11-17 00:48:52,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2024-11-17 00:48:52,025 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 6 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:52,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 201 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 92 Unchecked, 0.0s Time] [2024-11-17 00:48:52,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-17 00:48:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-17 00:48:52,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 67 states have internal predecessors, (71), 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) [2024-11-17 00:48:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-11-17 00:48:52,029 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 42 [2024-11-17 00:48:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:52,029 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-11-17 00:48:52,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) [2024-11-17 00:48:52,029 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-11-17 00:48:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-17 00:48:52,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:52,030 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:52,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 00:48:52,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:52,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:48:52,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:52,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1132304275, now seen corresponding path program 1 times [2024-11-17 00:48:52,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:52,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996609339] [2024-11-17 00:48:52,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:52,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:52,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:48:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:52,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 00:48:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:52,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 00:48:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-17 00:48:52,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:52,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996609339] [2024-11-17 00:48:52,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996609339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:52,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:52,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:48:52,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780894522] [2024-11-17 00:48:52,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:52,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:48:52,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:52,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:48:52,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:48:52,331 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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) [2024-11-17 00:48:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:52,422 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2024-11-17 00:48:52,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:48:52,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 43 [2024-11-17 00:48:52,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:52,423 INFO L225 Difference]: With dead ends: 71 [2024-11-17 00:48:52,423 INFO L226 Difference]: Without dead ends: 71 [2024-11-17 00:48:52,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:48:52,423 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 3 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:52,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 239 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:52,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-17 00:48:52,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-17 00:48:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.320754716981132) internal successors, (70), 66 states have internal predecessors, (70), 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) [2024-11-17 00:48:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2024-11-17 00:48:52,426 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 43 [2024-11-17 00:48:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:52,426 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2024-11-17 00:48:52,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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) [2024-11-17 00:48:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2024-11-17 00:48:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-17 00:48:52,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:52,427 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:52,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:48:52,427 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:48:52,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:52,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1132304274, now seen corresponding path program 1 times [2024-11-17 00:48:52,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:52,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879078849] [2024-11-17 00:48:52,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:52,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:52,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:48:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:52,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 00:48:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:52,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 00:48:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-17 00:48:52,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:52,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879078849] [2024-11-17 00:48:52,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879078849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:52,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:52,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:48:52,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033064775] [2024-11-17 00:48:52,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:52,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:48:52,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:52,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:48:52,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:48:52,611 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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) [2024-11-17 00:48:52,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:52,693 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2024-11-17 00:48:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:48:52,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 43 [2024-11-17 00:48:52,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:52,695 INFO L225 Difference]: With dead ends: 70 [2024-11-17 00:48:52,695 INFO L226 Difference]: Without dead ends: 70 [2024-11-17 00:48:52,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:48:52,697 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:52,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 251 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-17 00:48:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-17 00:48:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 65 states have internal predecessors, (69), 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) [2024-11-17 00:48:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2024-11-17 00:48:52,701 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 43 [2024-11-17 00:48:52,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:52,701 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2024-11-17 00:48:52,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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) [2024-11-17 00:48:52,702 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2024-11-17 00:48:52,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-17 00:48:52,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:52,704 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:52,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:48:52,705 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:48:52,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:52,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1797027240, now seen corresponding path program 1 times [2024-11-17 00:48:52,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:52,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765816455] [2024-11-17 00:48:52,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:52,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:52,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:48:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:52,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 00:48:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:52,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 00:48:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-17 00:48:52,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:52,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765816455] [2024-11-17 00:48:52,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765816455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:52,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:52,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:48:52,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303445378] [2024-11-17 00:48:52,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:52,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:48:52,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:52,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:48:52,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:48:52,898 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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) [2024-11-17 00:48:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:52,967 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2024-11-17 00:48:52,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:48:52,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 47 [2024-11-17 00:48:52,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:52,968 INFO L225 Difference]: With dead ends: 68 [2024-11-17 00:48:52,968 INFO L226 Difference]: Without dead ends: 68 [2024-11-17 00:48:52,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:48:52,968 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 25 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:52,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 246 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-17 00:48:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-17 00:48:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 63 states have internal predecessors, (67), 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) [2024-11-17 00:48:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2024-11-17 00:48:52,971 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 47 [2024-11-17 00:48:52,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:52,971 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2024-11-17 00:48:52,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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) [2024-11-17 00:48:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2024-11-17 00:48:52,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-17 00:48:52,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:52,972 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:52,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:48:52,972 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:48:52,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:52,972 INFO L85 PathProgramCache]: Analyzing trace with hash -149579839, now seen corresponding path program 1 times [2024-11-17 00:48:52,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:52,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859365917] [2024-11-17 00:48:52,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:52,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:53,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:48:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:53,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 00:48:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:53,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 00:48:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-17 00:48:53,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:53,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859365917] [2024-11-17 00:48:53,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859365917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:53,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:53,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:48:53,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679662334] [2024-11-17 00:48:53,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:53,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:48:53,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:53,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:48:53,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:48:53,176 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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) [2024-11-17 00:48:53,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:53,315 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2024-11-17 00:48:53,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:48:53,316 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 51 [2024-11-17 00:48:53,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:53,317 INFO L225 Difference]: With dead ends: 70 [2024-11-17 00:48:53,317 INFO L226 Difference]: Without dead ends: 70 [2024-11-17 00:48:53,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:48:53,318 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 26 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:53,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 287 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:53,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-17 00:48:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-17 00:48:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 65 states have internal predecessors, (71), 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) [2024-11-17 00:48:53,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2024-11-17 00:48:53,321 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 51 [2024-11-17 00:48:53,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:53,321 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2024-11-17 00:48:53,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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) [2024-11-17 00:48:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2024-11-17 00:48:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-17 00:48:53,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:53,322 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:53,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:48:53,322 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:48:53,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:53,323 INFO L85 PathProgramCache]: Analyzing trace with hash -149579838, now seen corresponding path program 1 times [2024-11-17 00:48:53,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:53,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437911089] [2024-11-17 00:48:53,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:53,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:53,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:48:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:53,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 00:48:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:53,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 00:48:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-17 00:48:53,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:53,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437911089] [2024-11-17 00:48:53,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437911089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:53,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:53,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:48:53,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123274438] [2024-11-17 00:48:53,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:53,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:48:53,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:53,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:48:53,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:48:53,673 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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) [2024-11-17 00:48:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:53,791 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-11-17 00:48:53,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:48:53,792 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 51 [2024-11-17 00:48:53,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:53,792 INFO L225 Difference]: With dead ends: 72 [2024-11-17 00:48:53,793 INFO L226 Difference]: Without dead ends: 72 [2024-11-17 00:48:53,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:48:53,794 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 26 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:53,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 288 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:53,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-17 00:48:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-17 00:48:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 67 states have internal predecessors, (72), 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) [2024-11-17 00:48:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-11-17 00:48:53,798 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 51 [2024-11-17 00:48:53,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:53,798 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-11-17 00:48:53,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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) [2024-11-17 00:48:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-11-17 00:48:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-17 00:48:53,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:53,798 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:53,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:48:53,799 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:48:53,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:53,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2041799475, now seen corresponding path program 1 times [2024-11-17 00:48:53,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:53,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004881994] [2024-11-17 00:48:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:53,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:53,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:48:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:53,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 00:48:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:53,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 00:48:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-17 00:48:54,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:54,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004881994] [2024-11-17 00:48:54,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004881994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:54,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:54,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 00:48:54,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9584403] [2024-11-17 00:48:54,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:54,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:48:54,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:54,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:48:54,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:48:54,011 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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) [2024-11-17 00:48:54,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:54,095 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2024-11-17 00:48:54,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:48:54,096 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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 54 [2024-11-17 00:48:54,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:54,096 INFO L225 Difference]: With dead ends: 72 [2024-11-17 00:48:54,096 INFO L226 Difference]: Without dead ends: 72 [2024-11-17 00:48:54,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:48:54,097 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:54,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 337 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-17 00:48:54,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-17 00:48:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 67 states have internal predecessors, (71), 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) [2024-11-17 00:48:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-11-17 00:48:54,099 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 54 [2024-11-17 00:48:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:54,100 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-11-17 00:48:54,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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) [2024-11-17 00:48:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-11-17 00:48:54,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-17 00:48:54,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:54,100 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:54,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:48:54,101 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:48:54,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1516058464, now seen corresponding path program 1 times [2024-11-17 00:48:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:54,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849641310] [2024-11-17 00:48:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:54,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:54,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:48:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:54,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 00:48:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:54,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 00:48:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-17 00:48:54,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:54,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849641310] [2024-11-17 00:48:54,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849641310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:54,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:54,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 00:48:54,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537754785] [2024-11-17 00:48:54,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:54,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:48:54,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:54,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:48:54,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:48:54,521 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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) [2024-11-17 00:48:54,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:54,692 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2024-11-17 00:48:54,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:48:54,693 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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 57 [2024-11-17 00:48:54,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:54,693 INFO L225 Difference]: With dead ends: 77 [2024-11-17 00:48:54,694 INFO L226 Difference]: Without dead ends: 77 [2024-11-17 00:48:54,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-11-17 00:48:54,694 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 27 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:54,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 462 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-17 00:48:54,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2024-11-17 00:48:54,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 68 states have internal predecessors, (72), 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) [2024-11-17 00:48:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2024-11-17 00:48:54,696 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 57 [2024-11-17 00:48:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:54,696 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2024-11-17 00:48:54,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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) [2024-11-17 00:48:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2024-11-17 00:48:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-17 00:48:54,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:54,697 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:54,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:48:54,697 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:48:54,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1516156772, now seen corresponding path program 1 times [2024-11-17 00:48:54,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:54,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759578641] [2024-11-17 00:48:54,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:54,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:55,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:48:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:55,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 00:48:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:55,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 00:48:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:48:55,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:55,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759578641] [2024-11-17 00:48:55,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759578641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:55,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419569748] [2024-11-17 00:48:55,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:55,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:55,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:55,582 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) [2024-11-17 00:48:55,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 00:48:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:55,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-17 00:48:55,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:55,773 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 [2024-11-17 00:48:55,923 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 [2024-11-17 00:48:55,997 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-17 00:48:55,998 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 [2024-11-17 00:48:56,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-17 00:48:56,256 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:56,257 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:56,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2024-11-17 00:48:56,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:48:56,348 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:56,349 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-17 00:48:56,352 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:56,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:56,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2024-11-17 00:48:56,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:56,443 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 19 treesize of output 17 [2024-11-17 00:48:56,571 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:48:56,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:56,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-17 00:49:00,749 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 0) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) 1))))) (and (or .cse0 (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_15|) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#2.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 0))) (or .cse0 (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-17 00:49:00,802 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 70 treesize of output 52 [2024-11-17 00:49:00,841 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 46 treesize of output 36 [2024-11-17 00:49:00,856 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 46 treesize of output 36 [2024-11-17 00:49:01,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419569748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:01,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:49:01,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 40 [2024-11-17 00:49:01,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584851185] [2024-11-17 00:49:01,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:01,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-17 00:49:01,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:01,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-17 00:49:01,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2025, Unknown=1, NotChecked=90, Total=2256 [2024-11-17 00:49:01,348 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 41 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 35 states have internal predecessors, (82), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:49:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:02,463 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2024-11-17 00:49:02,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 00:49:02,463 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 35 states have internal predecessors, (82), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2024-11-17 00:49:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:02,464 INFO L225 Difference]: With dead ends: 76 [2024-11-17 00:49:02,464 INFO L226 Difference]: Without dead ends: 76 [2024-11-17 00:49:02,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=273, Invalid=3390, Unknown=1, NotChecked=118, Total=3782 [2024-11-17 00:49:02,465 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 103 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:02,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 819 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:49:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-17 00:49:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-17 00:49:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 71 states have internal predecessors, (77), 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) [2024-11-17 00:49:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2024-11-17 00:49:02,467 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 57 [2024-11-17 00:49:02,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:02,468 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2024-11-17 00:49:02,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 35 states have internal predecessors, (82), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:49:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-11-17 00:49:02,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-17 00:49:02,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:02,468 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:02,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-17 00:49:02,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-17 00:49:02,669 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:49:02,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:02,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1516156773, now seen corresponding path program 1 times [2024-11-17 00:49:02,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:02,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369126153] [2024-11-17 00:49:02,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:02,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:03,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:49:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:03,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 00:49:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:03,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 00:49:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 00:49:03,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:03,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369126153] [2024-11-17 00:49:03,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369126153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:03,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840460987] [2024-11-17 00:49:03,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:03,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:03,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:03,586 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) [2024-11-17 00:49:03,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 00:49:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:03,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-17 00:49:03,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:03,825 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 [2024-11-17 00:49:04,064 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 [2024-11-17 00:49:04,242 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-17 00:49:04,242 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 [2024-11-17 00:49:04,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-17 00:49:04,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-17 00:49:04,572 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:04,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 23 [2024-11-17 00:49:04,576 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:04,595 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-17 00:49:04,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 39 [2024-11-17 00:49:04,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2024-11-17 00:49:04,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-17 00:49:04,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-17 00:49:04,784 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 9 treesize of output 3 [2024-11-17 00:49:04,917 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:49:04,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:05,242 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 190 treesize of output 160 [2024-11-17 00:49:05,244 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 286 treesize of output 226 [2024-11-17 00:49:05,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:49:05,261 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 74 treesize of output 44 [2024-11-17 00:49:05,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840460987] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:05,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:49:05,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2024-11-17 00:49:05,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594374974] [2024-11-17 00:49:05,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:05,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-17 00:49:05,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:05,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-17 00:49:05,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2696, Unknown=0, NotChecked=0, Total=2862 [2024-11-17 00:49:05,599 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 44 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 38 states have internal predecessors, (92), 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) [2024-11-17 00:49:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:07,067 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-17 00:49:07,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 00:49:07,067 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 38 states have internal predecessors, (92), 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 57 [2024-11-17 00:49:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:07,068 INFO L225 Difference]: With dead ends: 85 [2024-11-17 00:49:07,068 INFO L226 Difference]: Without dead ends: 85 [2024-11-17 00:49:07,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=363, Invalid=5337, Unknown=0, NotChecked=0, Total=5700 [2024-11-17 00:49:07,070 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 77 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:07,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1280 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 00:49:07,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-17 00:49:07,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-17 00:49:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.2) internal successors, (84), 79 states have internal predecessors, (84), 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) [2024-11-17 00:49:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-17 00:49:07,072 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 57 [2024-11-17 00:49:07,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:07,072 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-17 00:49:07,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 38 states have internal predecessors, (92), 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) [2024-11-17 00:49:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-17 00:49:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-17 00:49:07,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:07,073 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:07,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 00:49:07,277 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,SelfDestructingSolverStorable16 [2024-11-17 00:49:07,278 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:49:07,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:07,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1949039792, now seen corresponding path program 1 times [2024-11-17 00:49:07,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:07,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735251839] [2024-11-17 00:49:07,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:07,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:07,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:49:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:07,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 00:49:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:07,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 00:49:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 00:49:07,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:07,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735251839] [2024-11-17 00:49:07,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735251839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130726903] [2024-11-17 00:49:07,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:07,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:07,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:07,915 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) [2024-11-17 00:49:07,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 00:49:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:08,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-17 00:49:08,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:08,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-17 00:49:08,394 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:08,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2024-11-17 00:49:08,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:49:08,452 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:08,452 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-17 00:49:08,456 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:08,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:08,458 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 22 treesize of output 17 [2024-11-17 00:49:08,503 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 20 treesize of output 8 [2024-11-17 00:49:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:49:08,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:08,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-17 00:49:08,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2024-11-17 00:49:08,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:08,705 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 21 treesize of output 21 [2024-11-17 00:49:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-17 00:49:08,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130726903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:49:08,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:49:08,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 18] total 44 [2024-11-17 00:49:08,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350225948] [2024-11-17 00:49:08,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:08,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-17 00:49:08,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:08,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-17 00:49:08,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1762, Unknown=0, NotChecked=0, Total=1892 [2024-11-17 00:49:08,882 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 39 states have internal predecessors, (100), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-17 00:49:12,907 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] [2024-11-17 00:49:16,951 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] [2024-11-17 00:49:20,966 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] [2024-11-17 00:49:25,022 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] [2024-11-17 00:49:29,091 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] [2024-11-17 00:49:33,406 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] [2024-11-17 00:49:33,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:33,715 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-11-17 00:49:33,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 00:49:33,715 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 39 states have internal predecessors, (100), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 60 [2024-11-17 00:49:33,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:33,716 INFO L225 Difference]: With dead ends: 85 [2024-11-17 00:49:33,716 INFO L226 Difference]: Without dead ends: 85 [2024-11-17 00:49:33,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=291, Invalid=3615, Unknown=0, NotChecked=0, Total=3906 [2024-11-17 00:49:33,717 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 99 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:33,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1137 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 940 Invalid, 6 Unknown, 0 Unchecked, 24.4s Time] [2024-11-17 00:49:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-17 00:49:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-17 00:49:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 79 states have internal predecessors, (83), 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) [2024-11-17 00:49:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2024-11-17 00:49:33,719 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 60 [2024-11-17 00:49:33,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:33,720 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2024-11-17 00:49:33,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 39 states have internal predecessors, (100), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-17 00:49:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2024-11-17 00:49:33,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-17 00:49:33,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:33,720 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:33,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-17 00:49:33,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-17 00:49:33,921 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:49:33,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:33,922 INFO L85 PathProgramCache]: Analyzing trace with hash -223686461, now seen corresponding path program 1 times [2024-11-17 00:49:33,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:33,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226264326] [2024-11-17 00:49:33,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:33,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:34,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:49:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:34,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 00:49:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:34,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 00:49:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 00:49:35,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:35,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226264326] [2024-11-17 00:49:35,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226264326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:35,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946925855] [2024-11-17 00:49:35,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:35,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:35,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:35,052 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) [2024-11-17 00:49:35,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-17 00:49:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:35,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-17 00:49:35,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:35,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:49:35,386 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-17 00:49:35,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2024-11-17 00:49:35,593 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 29 treesize of output 21 [2024-11-17 00:49:35,930 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-17 00:49:35,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2024-11-17 00:49:36,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-17 00:49:36,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:49:36,353 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-17 00:49:36,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 56 [2024-11-17 00:49:36,536 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:36,537 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:36,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 52 [2024-11-17 00:49:36,541 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:36,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:36,588 INFO L349 Elim1Store]: treesize reduction 52, result has 51.4 percent of original size [2024-11-17 00:49:36,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 112 treesize of output 127 [2024-11-17 00:49:36,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:36,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 136 [2024-11-17 00:49:36,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:36,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 124 [2024-11-17 00:49:37,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:37,976 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 64 treesize of output 58 [2024-11-17 00:49:37,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:37,983 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 56 treesize of output 46 [2024-11-17 00:49:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:49:38,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:39,087 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 80 treesize of output 62 [2024-11-17 00:49:39,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 48 [2024-11-17 00:49:51,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946925855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:51,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:49:51,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 52 [2024-11-17 00:49:51,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38013190] [2024-11-17 00:49:51,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:51,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-17 00:49:51,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:51,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-17 00:49:51,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3862, Unknown=5, NotChecked=0, Total=4032 [2024-11-17 00:49:51,926 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 52 states, 50 states have (on average 1.96) internal successors, (98), 46 states have internal predecessors, (98), 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) [2024-11-17 00:49:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:55,333 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2024-11-17 00:49:55,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-17 00:49:55,334 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.96) internal successors, (98), 46 states have internal predecessors, (98), 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 63 [2024-11-17 00:49:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:55,334 INFO L225 Difference]: With dead ends: 90 [2024-11-17 00:49:55,334 INFO L226 Difference]: Without dead ends: 90 [2024-11-17 00:49:55,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=387, Invalid=8164, Unknown=5, NotChecked=0, Total=8556 [2024-11-17 00:49:55,336 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 74 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 1814 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:55,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1733 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1814 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 00:49:55,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-17 00:49:55,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2024-11-17 00:49:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 80 states have internal predecessors, (84), 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) [2024-11-17 00:49:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-11-17 00:49:55,339 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 63 [2024-11-17 00:49:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:55,339 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-11-17 00:49:55,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.96) internal successors, (98), 46 states have internal predecessors, (98), 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) [2024-11-17 00:49:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-11-17 00:49:55,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-17 00:49:55,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:55,339 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:55,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-17 00:49:55,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:55,540 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:49:55,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:55,541 INFO L85 PathProgramCache]: Analyzing trace with hash -223588153, now seen corresponding path program 2 times [2024-11-17 00:49:55,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:55,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214383389] [2024-11-17 00:49:55,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:55,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:56,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:49:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:56,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 00:49:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:56,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 00:49:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:49:56,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:56,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214383389] [2024-11-17 00:49:56,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214383389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:56,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70634619] [2024-11-17 00:49:56,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:49:56,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:56,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:56,874 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) [2024-11-17 00:49:56,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-17 00:49:57,060 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:49:57,061 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:49:57,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-17 00:49:57,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:57,262 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-17 00:49:57,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-17 00:49:57,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:49:57,525 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 [2024-11-17 00:49:57,528 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 [2024-11-17 00:49:57,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:49:57,740 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 [2024-11-17 00:49:57,762 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-17 00:49:57,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2024-11-17 00:49:58,051 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 19 treesize of output 1 [2024-11-17 00:49:58,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 42 [2024-11-17 00:49:58,196 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-11-17 00:49:58,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 43 [2024-11-17 00:49:58,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 60 [2024-11-17 00:49:58,297 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 160 treesize of output 116 [2024-11-17 00:49:58,300 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 115 treesize of output 83 [2024-11-17 00:49:58,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-17 00:49:58,713 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-17 00:49:58,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 37 [2024-11-17 00:49:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:59,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:59,775 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 102 treesize of output 72 [2024-11-17 00:50:01,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:01,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 254 treesize of output 303 [2024-11-17 00:50:01,186 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-17 00:50:01,186 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 2 case distinctions, treesize of input 35 treesize of output 8 [2024-11-17 00:50:01,201 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-17 00:50:01,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 40 [2024-11-17 00:50:01,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70634619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:50:01,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:50:01,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 62 [2024-11-17 00:50:01,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662885898] [2024-11-17 00:50:01,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:50:01,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-17 00:50:01,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:50:01,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-17 00:50:01,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=5449, Unknown=0, NotChecked=0, Total=5700 [2024-11-17 00:50:01,793 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 63 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 55 states have internal predecessors, (109), 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) [2024-11-17 00:50:04,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:50:04,886 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2024-11-17 00:50:04,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 00:50:04,886 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 55 states have internal predecessors, (109), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2024-11-17 00:50:04,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:50:04,887 INFO L225 Difference]: With dead ends: 92 [2024-11-17 00:50:04,887 INFO L226 Difference]: Without dead ends: 92 [2024-11-17 00:50:04,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=583, Invalid=10547, Unknown=0, NotChecked=0, Total=11130 [2024-11-17 00:50:04,889 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 131 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 2310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:50:04,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1324 Invalid, 2310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2298 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 00:50:04,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-17 00:50:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-11-17 00:50:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 83 states have internal predecessors, (89), 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) [2024-11-17 00:50:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2024-11-17 00:50:04,891 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 63 [2024-11-17 00:50:04,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:50:04,891 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2024-11-17 00:50:04,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 55 states have internal predecessors, (109), 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) [2024-11-17 00:50:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2024-11-17 00:50:04,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-17 00:50:04,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:50:04,892 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:50:04,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-17 00:50:05,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:50:05,093 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2024-11-17 00:50:05,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:50:05,093 INFO L85 PathProgramCache]: Analyzing trace with hash -223588152, now seen corresponding path program 2 times [2024-11-17 00:50:05,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:50:05,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906607662] [2024-11-17 00:50:05,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:05,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:50:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:06,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 00:50:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:06,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 00:50:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:06,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 00:50:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:50:07,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:50:07,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906607662] [2024-11-17 00:50:07,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906607662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:50:07,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051676965] [2024-11-17 00:50:07,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:50:07,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:50:07,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:50:07,080 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) [2024-11-17 00:50:07,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-17 00:50:07,261 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:50:07,261 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:50:07,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-11-17 00:50:07,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:50:07,698 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:50:07,699 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 16 treesize of output 15 [2024-11-17 00:50:07,714 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-17 00:50:07,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-17 00:50:07,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:50:07,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:50:08,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 29 [2024-11-17 00:50:08,126 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 27 treesize of output 11 [2024-11-17 00:50:08,129 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 [2024-11-17 00:50:08,131 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 [2024-11-17 00:50:08,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:50:08,427 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 61 treesize of output 44 [2024-11-17 00:50:08,442 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-17 00:50:08,442 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 32 treesize of output 39 [2024-11-17 00:50:08,454 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-17 00:50:08,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 30 [2024-11-17 00:50:08,470 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 35 treesize of output 31 [2024-11-17 00:50:08,489 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-17 00:50:08,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-17 00:50:08,811 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 69 treesize of output 52 [2024-11-17 00:50:08,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2024-11-17 00:50:08,968 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-11-17 00:50:08,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 43 [2024-11-17 00:50:08,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 68 [2024-11-17 00:50:09,079 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 173 treesize of output 129 [2024-11-17 00:50:09,081 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 133 treesize of output 97 [2024-11-17 00:50:09,617 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-17 00:50:09,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 54 [2024-11-17 00:50:09,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:09,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 28 [2024-11-17 00:50:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:50:09,954 INFO L311 TraceCheckSpWp]: Computing backward predicates...